Base | Representation |
---|---|
bin | 101011101000100… |
… | …1110100000110001 |
3 | 10210001000200211101 |
4 | 1113101032200301 |
5 | 10444304234211 |
6 | 401141244401 |
7 | 51165634213 |
oct | 12721164061 |
9 | 3701020741 |
10 | 1464133681 |
11 | 69151333a |
12 | 34a403701 |
13 | 1a44450ba |
14 | dc6485b3 |
15 | 888125c1 |
hex | 5744e831 |
1464133681 has 2 divisors, whose sum is σ = 1464133682. Its totient is φ = 1464133680.
The previous prime is 1464133679. The next prime is 1464133729. The reversal of 1464133681 is 1863314641.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 946116081 + 518017600 = 30759^2 + 22760^2 .
It is a cyclic number.
It is not a de Polignac number, because 1464133681 - 21 = 1464133679 is a prime.
It is a super-2 number, since 2×14641336812 = 4287374871677219522, which contains 22 as substring.
Together with 1464133679, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1464133681.
It is not a weakly prime, because it can be changed into another prime (1464133631) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 732066840 + 732066841.
It is an arithmetic number, because the mean of its divisors is an integer number (732066841).
Almost surely, 21464133681 is an apocalyptic number.
It is an amenable number.
1464133681 is a deficient number, since it is larger than the sum of its proper divisors (1).
1464133681 is an equidigital number, since it uses as much as digits as its factorization.
1464133681 is an evil number, because the sum of its binary digits is even.
The product of its digits is 41472, while the sum is 37.
The square root of 1464133681 is about 38263.9998039933. Note that the first 3 decimals coincide. The cubic root of 1464133681 is about 1135.5168342296.
The spelling of 1464133681 in words is "one billion, four hundred sixty-four million, one hundred thirty-three thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •