Base | Representation |
---|---|
bin | 1110001001101111111101… |
… | …11011111111110000011110 |
3 | 11002012011112222001212201211 |
4 | 13010313332323333300132 |
5 | 13034342423142400110 |
6 | 150104533531255034 |
7 | 6361304126336116 |
oct | 704677673776036 |
9 | 132164488055654 |
10 | 31121315200030 |
11 | 9a09526110340 |
12 | 35a76295aa47a |
13 | 144995c21c803 |
14 | 7983cb696046 |
15 | 38e80bbd998a |
hex | 1c4dfeeffc1e |
31121315200030 has 32 divisors (see below), whose sum is σ = 61124845488480. Its totient is φ = 11314267950720.
The previous prime is 31121315200009. The next prime is 31121315200049. The reversal of 31121315200030 is 3000251312113.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 31121315199974 and 31121315200010.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31688385 + ... + 32655724.
It is an arithmetic number, because the mean of its divisors is an integer number (1910151421515).
Almost surely, 231121315200030 is an apocalyptic number.
31121315200030 is a deficient number, since it is larger than the sum of its proper divisors (30003530288450).
31121315200030 is a wasteful number, since it uses less digits than its factorization.
31121315200030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64348524.
The product of its (nonzero) digits is 540, while the sum is 22.
Adding to 31121315200030 its reverse (3000251312113), we get a palindrome (34121566512143).
The spelling of 31121315200030 in words is "thirty-one trillion, one hundred twenty-one billion, three hundred fifteen million, two hundred thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •