Base | Representation |
---|---|
bin | 1001001010010110000010… |
… | …00001101110011110111101 |
3 | 2122022222222122020001002202 |
4 | 10211023001001232132331 |
5 | 10120040302034322334 |
6 | 110503123020401245 |
7 | 4146355253414462 |
oct | 445130101563675 |
9 | 78288878201082 |
10 | 20146635073469 |
11 | 646815a306073 |
12 | 23146773a6225 |
13 | b31a8669a6b8 |
14 | 4d9160b71669 |
15 | 24e0d833a17e |
hex | 1252c106e7bd |
20146635073469 has 2 divisors, whose sum is σ = 20146635073470. Its totient is φ = 20146635073468.
The previous prime is 20146635073459. The next prime is 20146635073471. The reversal of 20146635073469 is 96437053664102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20142476113369 + 4158960100 = 4488037^2 + 64490^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20146635073469 is a prime.
It is a super-2 number, since 2×201466350734692 (a number of 27 digits) contains 22 as substring.
Together with 20146635073471, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20146635073459) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10073317536734 + 10073317536735.
It is an arithmetic number, because the mean of its divisors is an integer number (10073317536735).
Almost surely, 220146635073469 is an apocalyptic number.
It is an amenable number.
20146635073469 is a deficient number, since it is larger than the sum of its proper divisors (1).
20146635073469 is an equidigital number, since it uses as much as digits as its factorization.
20146635073469 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 19595520, while the sum is 56.
The spelling of 20146635073469 in words is "twenty trillion, one hundred forty-six billion, six hundred thirty-five million, seventy-three thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •