Base | Representation |
---|---|
bin | 1110001001001100000000… |
… | …11100011001111001111011 |
3 | 11002010022201202210121212102 |
4 | 13010212000130121321323 |
5 | 13034033410324320443 |
6 | 150052022332534015 |
7 | 6360021610351511 |
oct | 704460034317173 |
9 | 132108652717772 |
10 | 31102013120123 |
11 | 9a0132063aa90 |
12 | 35a394132130b |
13 | 1447ba430665a |
14 | 7974b9d664b1 |
15 | 38e07c37ecb8 |
hex | 1c4980719e7b |
31102013120123 has 8 divisors (see below), whose sum is σ = 34485689660016. Its totient is φ = 27811040047200.
The previous prime is 31102013120039. The next prime is 31102013120153. The reversal of 31102013120123 is 32102131020113.
It is a happy number.
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 31102013120123 - 220 = 31102012071547 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31102013120095 and 31102013120104.
It is not an unprimeable number, because it can be changed into a prime (31102013120153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23175866036 + ... + 23175867377.
It is an arithmetic number, because the mean of its divisors is an integer number (4310711207502).
Almost surely, 231102013120123 is an apocalyptic number.
31102013120123 is a deficient number, since it is larger than the sum of its proper divisors (3383676539893).
31102013120123 is a wasteful number, since it uses less digits than its factorization.
31102013120123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46351733485.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 31102013120123 its reverse (32102131020113), we get a palindrome (63204144140236).
The spelling of 31102013120123 in words is "thirty-one trillion, one hundred two billion, thirteen million, one hundred twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •