Base | Representation |
---|---|
bin | 11101000100010001… |
… | …100000111011110110 |
3 | 2222120002112002122220 |
4 | 131010101200323312 |
5 | 1002404303304420 |
6 | 22200543103210 |
7 | 2153263301646 |
oct | 350421407366 |
9 | 88502462586 |
10 | 31210213110 |
11 | 1226639605a |
12 | 60702a1b06 |
13 | 2c3502412b |
14 | 1721076526 |
15 | c29ed0840 |
hex | 744460ef6 |
31210213110 has 32 divisors (see below), whose sum is σ = 76731453792. Its totient is φ = 8119729920.
The previous prime is 31210213063. The next prime is 31210213123. The reversal of 31210213110 is 1131201213.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 31210213110.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 12685849 + ... + 12688308.
It is an arithmetic number, because the mean of its divisors is an integer number (2397857931).
Almost surely, 231210213110 is an apocalyptic number.
31210213110 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
31210213110 is an abundant number, since it is smaller than the sum of its proper divisors (45521240682).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31210213110 is a wasteful number, since it uses less digits than its factorization.
31210213110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25374208.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 31210213110 its reverse (1131201213), we get a palindrome (32341414323).
The spelling of 31210213110 in words is "thirty-one billion, two hundred ten million, two hundred thirteen thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •