Base | Representation |
---|---|
bin | 1110100110001111000111… |
… | …01110110101110111101001 |
3 | 11012122201222221122002202002 |
4 | 13103013203232311313221 |
5 | 13201412011443412223 |
6 | 152134330525020345 |
7 | 6522104453112524 |
oct | 723074356656751 |
9 | 135581887562662 |
10 | 32100111310313 |
11 | a256642a94032 |
12 | 37252723b46b5 |
13 | 14bb048586937 |
14 | 7cd921993bbb |
15 | 3a9ee6b7be28 |
hex | 1d31e3bb5de9 |
32100111310313 has 8 divisors (see below), whose sum is σ = 33346653546240. Its totient is φ = 30866759997840.
The previous prime is 32100111310283. The next prime is 32100111310363. The reversal of 32100111310313 is 31301311100123.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 32100111310313 - 216 = 32100111244777 is a prime.
It is a super-2 number, since 2×321001113103132 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (32100111310363) 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, 3297725903 + ... + 3297735636.
It is an arithmetic number, because the mean of its divisors is an integer number (4168331693280).
Almost surely, 232100111310313 is an apocalyptic number.
It is an amenable number.
32100111310313 is a deficient number, since it is larger than the sum of its proper divisors (1246542235927).
32100111310313 is a wasteful number, since it uses less digits than its factorization.
32100111310313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6595461727.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 32100111310313 its reverse (31301311100123), we get a palindrome (63401422410436).
The spelling of 32100111310313 in words is "thirty-two trillion, one hundred billion, one hundred eleven million, three hundred ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •