Base | Representation |
---|---|
bin | 11101000101011101… |
… | …011000111010100000 |
3 | 2222121110221121201220 |
4 | 131011131120322200 |
5 | 1002424401300300 |
6 | 22202533255040 |
7 | 2153624332362 |
oct | 350535307240 |
9 | 88543847656 |
10 | 31230103200 |
11 | 1227664084a |
12 | 6076a94480 |
13 | 2c3919950a |
14 | 1723972d32 |
15 | c2bb0dda0 |
hex | 745758ea0 |
31230103200 has 72 divisors (see below), whose sum is σ = 101653993728. Its totient is φ = 8328026880.
The previous prime is 31230103199. The next prime is 31230103231. The reversal of 31230103200 is 230103213.
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 31230103200.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6503872 + ... + 6508671.
It is an arithmetic number, because the mean of its divisors is an integer number (1411861024).
Almost surely, 231230103200 is an apocalyptic number.
31230103200 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
31230103200 is an abundant number, since it is smaller than the sum of its proper divisors (70423890528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31230103200 is a wasteful number, since it uses less digits than its factorization.
31230103200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13012566 (or 13012553 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 31230103200 its reverse (230103213), we get a palindrome (31460206413).
The spelling of 31230103200 in words is "thirty-one billion, two hundred thirty million, one hundred three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •