Base | Representation |
---|---|
bin | 101101011110101100001010… |
… | …101000000000100000011100 |
3 | 222020012211102101101101020211 |
4 | 231132230022220000200130 |
5 | 202204121203122431022 |
6 | 1545224231440022204 |
7 | 60063022220135455 |
oct | 5536541250004034 |
9 | 866184371341224 |
10 | 200021100202012 |
11 | 58807521585431 |
12 | 1a525519901964 |
13 | 877bba788840b |
14 | 375710409c12c |
15 | 181d01b6d0e77 |
hex | b5eb0aa0081c |
200021100202012 has 12 divisors (see below), whose sum is σ = 350042428053360. Its totient is φ = 100008977901056.
The previous prime is 200021100202009. The next prime is 200021100202013. The reversal of 200021100202012 is 210202001120002.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 200021100201983 and 200021100202001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200021100202013) 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, 392763712 + ... + 393272647.
It is an arithmetic number, because the mean of its divisors is an integer number (29170202337780).
Almost surely, 2200021100202012 is an apocalyptic number.
It is an amenable number.
200021100202012 is a deficient number, since it is larger than the sum of its proper divisors (150021327851348).
200021100202012 is a wasteful number, since it uses less digits than its factorization.
200021100202012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 786099980 (or 786099978 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 200021100202012 its reverse (210202001120002), we get a palindrome (410223101322014).
The spelling of 200021100202012 in words is "two hundred trillion, twenty-one billion, one hundred million, two hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •