Base | Representation |
---|---|
bin | 11101000100111011… |
… | …000011011011011100 |
3 | 2222120212000022211020 |
4 | 131010323003123130 |
5 | 1002420100233200 |
6 | 22202012324140 |
7 | 2153454663603 |
oct | 350473033334 |
9 | 88525008736 |
10 | 31221102300 |
11 | 12271553293 |
12 | 6073a73650 |
13 | 2c3736763b |
14 | 17226aca3a |
15 | c2ae31ea0 |
hex | 744ec36dc |
31221102300 has 72 divisors (see below), whose sum is σ = 92536337712. Its totient is φ = 8122560000.
The previous prime is 31221102287. The next prime is 31221102307. The reversal of 31221102300 is 320112213.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 31221102300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31221102307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1256851 + ... + 1281450.
Almost surely, 231221102300 is an apocalyptic number.
31221102300 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
31221102300 is an abundant number, since it is smaller than the sum of its proper divisors (61315235412).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31221102300 is a wasteful number, since it uses less digits than its factorization.
31221102300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2538359 (or 2538352 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 31221102300 its reverse (320112213), we get a palindrome (31541214513).
The spelling of 31221102300 in words is "thirty-one billion, two hundred twenty-one million, one hundred two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •