Base | Representation |
---|---|
bin | 1110001100010101010110… |
… | …00011001001100001010100 |
3 | 11002111122201200021211100012 |
4 | 13012022223003021201110 |
5 | 13042321242114231400 |
6 | 150213420054535352 |
7 | 6400566265503035 |
oct | 706125303114124 |
9 | 132448650254305 |
10 | 31210102102100 |
11 | 9a43147a99a59 |
12 | 3600888067558 |
13 | 145513b91295c |
14 | 79c811414a8c |
15 | 391ca67ded35 |
hex | 1c62ab0c9854 |
31210102102100 has 18 divisors (see below), whose sum is σ = 67725921561774. Its totient is φ = 12484040840800.
The previous prime is 31210102102097. The next prime is 31210102102169. The reversal of 31210102102100 is 120120101213.
It can be written as a sum of positive squares in 3 ways, for example, as 3896810233156 + 27313291868944 = 1974034^2 + 5226212^2 .
It is a super-3 number, since 3×312101021021003 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 156050510411 + ... + 156050510610.
Almost surely, 231210102102100 is an apocalyptic number.
It is an amenable number.
31210102102100 is an abundant number, since it is smaller than the sum of its proper divisors (36515819459674).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31210102102100 is a wasteful number, since it uses less digits than its factorization.
31210102102100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 312101021035 (or 312101021028 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 31210102102100 its reverse (120120101213), we get a palindrome (31330222203313).
The spelling of 31210102102100 in words is "thirty-one trillion, two hundred ten billion, one hundred two million, one hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •