Base | Representation |
---|---|
bin | 101011110100000… |
… | …0010000110011001 |
3 | 10210110021102202021 |
4 | 1113220002012121 |
5 | 11002322042103 |
6 | 401513334441 |
7 | 51300514156 |
oct | 12750020631 |
9 | 3713242667 |
10 | 1470112153 |
11 | 694927024 |
12 | 350407421 |
13 | 1a5759363 |
14 | dd36322d |
15 | 890e3bbd |
hex | 57a02199 |
1470112153 has 2 divisors, whose sum is σ = 1470112154. Its totient is φ = 1470112152.
The previous prime is 1470112121. The next prime is 1470112177. The reversal of 1470112153 is 3512110741.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1260818064 + 209294089 = 35508^2 + 14467^2 .
It is a cyclic number.
It is not a de Polignac number, because 1470112153 - 25 = 1470112121 is a prime.
It is a super-2 number, since 2×14701121532 = 4322459484796590818, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1470110153) 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, 735056076 + 735056077.
It is an arithmetic number, because the mean of its divisors is an integer number (735056077).
Almost surely, 21470112153 is an apocalyptic number.
It is an amenable number.
1470112153 is a deficient number, since it is larger than the sum of its proper divisors (1).
1470112153 is an equidigital number, since it uses as much as digits as its factorization.
1470112153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 840, while the sum is 25.
The square root of 1470112153 is about 38342.0415862275. The cubic root of 1470112153 is about 1137.0602808403.
Adding to 1470112153 its reverse (3512110741), we get a palindrome (4982222894).
The spelling of 1470112153 in words is "one billion, four hundred seventy million, one hundred twelve thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •