Base | Representation |
---|---|
bin | 1110001001101101111010… |
… | …01000111111110110010101 |
3 | 11002012001201000220120001202 |
4 | 13010312331020333312111 |
5 | 13034333143043441041 |
6 | 150104232215202245 |
7 | 6361234563420536 |
oct | 704667510776625 |
9 | 132161630816052 |
10 | 31120211312021 |
11 | 9a09009a8a9a7 |
12 | 35a737b976385 |
13 | 144981460a240 |
14 | 798324c2468d |
15 | 38e794d36a9b |
hex | 1c4dbd23fd95 |
31120211312021 has 64 divisors (see below), whose sum is σ = 35862769377792. Its totient is φ = 26751021023232.
The previous prime is 31120211311993. The next prime is 31120211312027. The reversal of 31120211312021 is 12021311202113.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31120211312021 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 31120211311984 and 31120211312002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31120211312027) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 7035994016 + ... + 7035998438.
It is an arithmetic number, because the mean of its divisors is an integer number (560355771528).
Almost surely, 231120211312021 is an apocalyptic number.
It is an amenable number.
31120211312021 is a deficient number, since it is larger than the sum of its proper divisors (4742558065771).
31120211312021 is a wasteful number, since it uses less digits than its factorization.
31120211312021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5502.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 31120211312021 its reverse (12021311202113), we get a palindrome (43141522514134).
The spelling of 31120211312021 in words is "thirty-one trillion, one hundred twenty billion, two hundred eleven million, three hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •