Base | Representation |
---|---|
bin | 101101011110101100011111… |
… | …000001000011011101001100 |
3 | 222020012212022020010100221120 |
4 | 231132230133001003131030 |
5 | 202204122403212441022 |
6 | 1545224325420400540 |
7 | 60063033543051636 |
oct | 5536543701033514 |
9 | 866185266110846 |
10 | 200021442312012 |
11 | 58807687700772 |
12 | 1a5255b43a6150 |
13 | 877bc3070b279 |
14 | 37571376b3a56 |
15 | 181d03b75bd5c |
hex | b5eb1f04374c |
200021442312012 has 24 divisors (see below), whose sum is σ = 467219084866800. Its totient is φ = 66602044655616.
The previous prime is 200021442312007. The next prime is 200021442312017. The reversal of 200021442312012 is 210213244120002.
It is an interprime number because it is at equal distance from previous prime (200021442312007) and next prime (200021442312017).
It is not an unprimeable number, because it can be changed into a prime (200021442312017) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8971169437 + ... + 8971191732.
It is an arithmetic number, because the mean of its divisors is an integer number (19467461869450).
Almost surely, 2200021442312012 is an apocalyptic number.
It is an amenable number.
200021442312012 is an abundant number, since it is smaller than the sum of its proper divisors (267197642554788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200021442312012 is a wasteful number, since it uses less digits than its factorization.
200021442312012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17942362105 (or 17942362103 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 200021442312012 its reverse (210213244120002), we get a palindrome (410234686432014).
The spelling of 200021442312012 in words is "two hundred trillion, twenty-one billion, four hundred forty-two million, three hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •