Base | Representation |
---|---|
bin | 101011110100000… |
… | …1001111000000001 |
3 | 10210110100001102211 |
4 | 1113220021320001 |
5 | 11002324102001 |
6 | 401514142121 |
7 | 51301006054 |
oct | 12750117001 |
9 | 3713301384 |
10 | 1470144001 |
11 | 694948a47 |
12 | 350421941 |
13 | 1a576a9c1 |
14 | dd370a9b |
15 | 890ed351 |
hex | 57a09e01 |
1470144001 has 2 divisors, whose sum is σ = 1470144002. Its totient is φ = 1470144000.
The previous prime is 1470143971. The next prime is 1470144059. The reversal of 1470144001 is 1004410741.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 795183601 + 674960400 = 28199^2 + 25980^2 .
It is a cyclic number.
It is not a de Polignac number, because 1470144001 - 29 = 1470143489 is a prime.
It is a super-2 number, since 2×14701440012 = 4322646767352576002, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1470144301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 735072000 + 735072001.
It is an arithmetic number, because the mean of its divisors is an integer number (735072001).
Almost surely, 21470144001 is an apocalyptic number.
It is an amenable number.
1470144001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1470144001 is an equidigital number, since it uses as much as digits as its factorization.
1470144001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 448, while the sum is 22.
The square root of 1470144001 is about 38342.4568983262. The cubic root of 1470144001 is about 1137.0684917409.
Adding to 1470144001 its reverse (1004410741), we get a palindrome (2474554742).
The spelling of 1470144001 in words is "one billion, four hundred seventy million, one hundred forty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •