Base | Representation |
---|---|
bin | 1110001111110111000111… |
… | …10010000110110011011011 |
3 | 11002221020121002000110002022 |
4 | 13013323203302012303123 |
5 | 13101313012113120443 |
6 | 150345223445325055 |
7 | 6412420100345504 |
oct | 707734362066333 |
9 | 132836532013068 |
10 | 31331313020123 |
11 | 9a8a598437776 |
12 | 362027540678b |
13 | 14636b7944b5c |
14 | 7a462d4cdbab |
15 | 394eecc3ae68 |
hex | 1c7ee3c86cdb |
31331313020123 has 4 divisors (see below), whose sum is σ = 31331359972920. Its totient is φ = 31331266067328.
The previous prime is 31331313020081. The next prime is 31331313020191. The reversal of 31331313020123 is 32102031313313.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 31331313020123 - 210 = 31331313019099 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31331313020092 and 31331313020101.
It is not an unprimeable number, because it can be changed into a prime (31331313020923) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22460813 + ... + 23814926.
It is an arithmetic number, because the mean of its divisors is an integer number (7832839993230).
Almost surely, 231331313020123 is an apocalyptic number.
31331313020123 is a deficient number, since it is larger than the sum of its proper divisors (46952797).
31331313020123 is an equidigital number, since it uses as much as digits as its factorization.
31331313020123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46952796.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 31331313020123 its reverse (32102031313313), we get a palindrome (63433344333436).
The spelling of 31331313020123 in words is "thirty-one trillion, three hundred thirty-one billion, three hundred thirteen million, twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •