Base | Representation |
---|---|
bin | 101011110100010… |
… | …0011110010011101 |
3 | 10210110112110000221 |
4 | 1113220203302131 |
5 | 11002341001031 |
6 | 401520321341 |
7 | 51301630363 |
oct | 12750436235 |
9 | 3713473027 |
10 | 1470250141 |
11 | 694a10768 |
12 | 350473251 |
13 | 1a57a70c9 |
14 | dd39b633 |
15 | 8911ea11 |
hex | 57a23c9d |
1470250141 has 2 divisors, whose sum is σ = 1470250142. Its totient is φ = 1470250140.
The previous prime is 1470250123. The next prime is 1470250169. The reversal of 1470250141 is 1410520741.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 826562500 + 643687641 = 28750^2 + 25371^2 .
It is a cyclic number.
It is not a de Polignac number, because 1470250141 - 27 = 1470250013 is a prime.
It is a super-2 number, since 2×14702501412 = 4323270954221039762, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1470250181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 735125070 + 735125071.
It is an arithmetic number, because the mean of its divisors is an integer number (735125071).
Almost surely, 21470250141 is an apocalyptic number.
It is an amenable number.
1470250141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1470250141 is an equidigital number, since it uses as much as digits as its factorization.
1470250141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1120, while the sum is 25.
The square root of 1470250141 is about 38343.8409787022. The cubic root of 1470250141 is about 1137.0958553972.
Adding to 1470250141 its reverse (1410520741), we get a palindrome (2880770882).
The spelling of 1470250141 in words is "one billion, four hundred seventy million, two hundred fifty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •