Base | Representation |
---|---|
bin | 11101000011101011… |
… | …010100110111100100 |
3 | 2222112101200111021220 |
4 | 131003223110313210 |
5 | 1002344222432322 |
6 | 22155544340340 |
7 | 2153112225444 |
oct | 350353246744 |
9 | 88471614256 |
10 | 31200202212 |
11 | 12260778793 |
12 | 6068a746b0 |
13 | 2c32c2a61a |
14 | 171d9cc124 |
15 | c291a455c |
hex | 743ad4de4 |
31200202212 has 12 divisors (see below), whose sum is σ = 72800471856. Its totient is φ = 10400067400.
The previous prime is 31200202177. The next prime is 31200202219. The reversal of 31200202212 is 21220200213.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 31200202191 and 31200202200.
It is not an unprimeable number, because it can be changed into a prime (31200202219) 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 3 ways as a sum of consecutive naturals, for example, 1300008414 + ... + 1300008437.
It is an arithmetic number, because the mean of its divisors is an integer number (6066705988).
Almost surely, 231200202212 is an apocalyptic number.
It is an amenable number.
31200202212 is an abundant number, since it is smaller than the sum of its proper divisors (41600269644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31200202212 is a wasteful number, since it uses less digits than its factorization.
31200202212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2600016858 (or 2600016856 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 31200202212 its reverse (21220200213), we get a palindrome (52420402425).
The spelling of 31200202212 in words is "thirty-one billion, two hundred million, two hundred two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •