Base | Representation |
---|---|
bin | 101111100000001011… |
… | …0001111001001000101 |
3 | 100202022100021002112202 |
4 | 1133000112033021011 |
5 | 3132404343134334 |
6 | 114510252124245 |
7 | 10240635523046 |
oct | 1370026171105 |
9 | 322270232482 |
10 | 102011302469 |
11 | 3a2987a244a |
12 | 1792b466685 |
13 | 980941344b |
14 | 4d1a21c8cd |
15 | 29c0ad117e |
hex | 17c058f245 |
102011302469 has 2 divisors, whose sum is σ = 102011302470. Its totient is φ = 102011302468.
The previous prime is 102011302447. The next prime is 102011302559. The reversal of 102011302469 is 964203110201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 85665679969 + 16345622500 = 292687^2 + 127850^2 .
It is an emirp because it is prime and its reverse (964203110201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102011302469 - 236 = 33291825733 is a prime.
It is a super-2 number, since 2×1020113024692 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102011302369) 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, 51005651234 + 51005651235.
It is an arithmetic number, because the mean of its divisors is an integer number (51005651235).
Almost surely, 2102011302469 is an apocalyptic number.
It is an amenable number.
102011302469 is a deficient number, since it is larger than the sum of its proper divisors (1).
102011302469 is an equidigital number, since it uses as much as digits as its factorization.
102011302469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 29.
The spelling of 102011302469 in words is "one hundred two billion, eleven million, three hundred two thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •