Base | Representation |
---|---|
bin | 1110001001011110111111… |
… | …01000010011100100011101 |
3 | 11002011022000201020020201120 |
4 | 13010233133220103210131 |
5 | 13034220241200310023 |
6 | 150100425233201153 |
7 | 6360532214446113 |
oct | 704573750234435 |
9 | 132138021206646 |
10 | 31112200010013 |
11 | 9a056788a3151 |
12 | 35a5904a001b9 |
13 | 1448b3893aa55 |
14 | 797ba4c57ab3 |
15 | 38e4768578e3 |
hex | 1c4bdfa1391d |
31112200010013 has 8 divisors (see below), whose sum is σ = 41483021450208. Its totient is φ = 20741422621584.
The previous prime is 31112200010009. The next prime is 31112200010029. The reversal of 31112200010013 is 31001000221113.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31112200010013 - 22 = 31112200010009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31112200009974 and 31112200010001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31112200010033) 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, 9328170 + ... + 12216347.
It is an arithmetic number, because the mean of its divisors is an integer number (5185377681276).
Almost surely, 231112200010013 is an apocalyptic number.
It is an amenable number.
31112200010013 is a deficient number, since it is larger than the sum of its proper divisors (10370821440195).
31112200010013 is a wasteful number, since it uses less digits than its factorization.
31112200010013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22025883.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 31112200010013 its reverse (31001000221113), we get a palindrome (62113200231126).
The spelling of 31112200010013 in words is "thirty-one trillion, one hundred twelve billion, two hundred million, ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •