Base | Representation |
---|---|
bin | 101111100000110001… |
… | …0100001111010100111 |
3 | 100202100201220012011122 |
4 | 1133001202201322213 |
5 | 3132430003133221 |
6 | 114512244524155 |
7 | 10241300521451 |
oct | 1370142417247 |
9 | 322321805148 |
10 | 102031302311 |
11 | 3a2a9012644 |
12 | 179360b065b |
13 | 98105c6783 |
14 | 4d1cb472d1 |
15 | 29c2731eab |
hex | 17c18a1ea7 |
102031302311 has 8 divisors (see below), whose sum is σ = 102991697424. Its totient is φ = 101071033920.
The previous prime is 102031302259. The next prime is 102031302341. The reversal of 102031302311 is 113203130201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102031302311 - 210 = 102031301287 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102031302311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102031302341) 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 in 7 ways as a sum of consecutive naturals, for example, 2633621 + ... + 2672081.
It is an arithmetic number, because the mean of its divisors is an integer number (12873962178).
Almost surely, 2102031302311 is an apocalyptic number.
102031302311 is a deficient number, since it is larger than the sum of its proper divisors (960395113).
102031302311 is a wasteful number, since it uses less digits than its factorization.
102031302311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63361.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 102031302311 its reverse (113203130201), we get a palindrome (215234432512).
The spelling of 102031302311 in words is "one hundred two billion, thirty-one million, three hundred two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •