Base | Representation |
---|---|
bin | 1110001001100000110111… |
… | …10101100100111110010010 |
3 | 11002011101122002221021001110 |
4 | 13010300123311210332102 |
5 | 13034224323242402010 |
6 | 150101113355314150 |
7 | 6360566231324313 |
oct | 704603365447622 |
9 | 132141562837043 |
10 | 31113210122130 |
11 | 9a06046aa3354 |
12 | 35a5b4714b956 |
13 | 1448c69ca8826 |
14 | 797c5d07860a |
15 | 38e4d5385120 |
hex | 1c4c1bd64f92 |
31113210122130 has 16 divisors (see below), whose sum is σ = 74671704293184. Its totient is φ = 8296856032560.
The previous prime is 31113210122077. The next prime is 31113210122219. The reversal of 31113210122130 is 3122101231113.
It is a junction number, because it is equal to n+sod(n) for n = 31113210122097 and 31113210122106.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 518553502006 + ... + 518553502065.
It is an arithmetic number, because the mean of its divisors is an integer number (4666981518324).
Almost surely, 231113210122130 is an apocalyptic number.
31113210122130 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
31113210122130 is an abundant number, since it is smaller than the sum of its proper divisors (43558494171054).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31113210122130 is a wasteful number, since it uses less digits than its factorization.
31113210122130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1037107004081.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 31113210122130 its reverse (3122101231113), we get a palindrome (34235311353243).
The spelling of 31113210122130 in words is "thirty-one trillion, one hundred thirteen billion, two hundred ten million, one hundred twenty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •