Base | Representation |
---|---|
bin | 10100101010100110010… |
… | …110111010000011000101 |
3 | 12000202121022120110100022 |
4 | 110222212112322003011 |
5 | 141231411314333334 |
6 | 3004222051224525 |
7 | 204413102534426 |
oct | 24524626720305 |
9 | 5022538513308 |
10 | 1420130230469 |
11 | 4a83015463a5 |
12 | 1ab2928a8145 |
13 | a3bc127b152 |
14 | 4ca3dd1164d |
15 | 26e1a55282e |
hex | 14aa65ba0c5 |
1420130230469 has 2 divisors, whose sum is σ = 1420130230470. Its totient is φ = 1420130230468.
The previous prime is 1420130230417. The next prime is 1420130230483. The reversal of 1420130230469 is 9640320310241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 904283079844 + 515847150625 = 950938^2 + 718225^2 .
It is a cyclic number.
It is not a de Polignac number, because 1420130230469 - 232 = 1415835263173 is a prime.
It is a super-2 number, since 2×14201302304692 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1420130230369) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 710065115234 + 710065115235.
It is an arithmetic number, because the mean of its divisors is an integer number (710065115235).
Almost surely, 21420130230469 is an apocalyptic number.
It is an amenable number.
1420130230469 is a deficient number, since it is larger than the sum of its proper divisors (1).
1420130230469 is an equidigital number, since it uses as much as digits as its factorization.
1420130230469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 35.
The spelling of 1420130230469 in words is "one trillion, four hundred twenty billion, one hundred thirty million, two hundred thirty thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •