Base | Representation |
---|---|
bin | 1011101001001011000… |
… | …1101110001001001101 |
3 | 201010022111121210220120 |
4 | 2322102301232021031 |
5 | 11234130414100323 |
6 | 231520514335153 |
7 | 20310645321246 |
oct | 2722261561115 |
9 | 633274553816 |
10 | 200031003213 |
11 | 77918317398 |
12 | 32925b8a4b9 |
13 | 15b2a885982 |
14 | 9978271ccd |
15 | 530b04a5e3 |
hex | 2e92c6e24d |
200031003213 has 16 divisors (see below), whose sum is σ = 269514168000. Its totient is φ = 131956755840.
The previous prime is 200031003209. The next prime is 200031003223. The reversal of 200031003213 is 312300130002.
200031003213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 200031003213 - 22 = 200031003209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200031003192 and 200031003201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200031003223) 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 15 ways as a sum of consecutive naturals, for example, 592048 + ... + 866361.
It is an arithmetic number, because the mean of its divisors is an integer number (16844635500).
Almost surely, 2200031003213 is an apocalyptic number.
It is an amenable number.
200031003213 is a deficient number, since it is larger than the sum of its proper divisors (69483164787).
200031003213 is a wasteful number, since it uses less digits than its factorization.
200031003213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1458892.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 200031003213 its reverse (312300130002), we get a palindrome (512331133215).
The spelling of 200031003213 in words is "two hundred billion, thirty-one million, three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •