Base | Representation |
---|---|
bin | 101101011110110101011110… |
… | …110110111000101110000100 |
3 | 222020020210020112000120120210 |
4 | 231132311132312320232010 |
5 | 202204302144422314022 |
6 | 1545233004213355420 |
7 | 60063525133226523 |
oct | 5536653666705604 |
9 | 866223215016523 |
10 | 200031103323012 |
11 | 58810795031285 |
12 | 1a52744b938b70 |
13 | 877cb100c9320 |
14 | 37577b27d44ba |
15 | 181d4049a8a0c |
hex | b5ed5edb8b84 |
200031103323012 has 96 divisors (see below), whose sum is σ = 505253877560320. Its totient is φ = 61228506890880.
The previous prime is 200031103323001. The next prime is 200031103323041. The reversal of 200031103323012 is 210323301130002.
It is a self number, because there is not a number n which added to its sum of digits gives 200031103323012.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 71134689 + ... + 73893207.
Almost surely, 2200031103323012 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 200031103323012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (252626938780160).
200031103323012 is an abundant number, since it is smaller than the sum of its proper divisors (305222774237308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200031103323012 is a wasteful number, since it uses less digits than its factorization.
200031103323012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2760953 (or 2760951 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 200031103323012 its reverse (210323301130002), we get a palindrome (410354404453014).
The spelling of 200031103323012 in words is "two hundred trillion, thirty-one billion, one hundred three million, three hundred twenty-three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •