Base | Representation |
---|---|
bin | 101101011110011001011101… |
… | …110100010110011011111100 |
3 | 222020010220121001000211011202 |
4 | 231132121131310112123330 |
5 | 202203304042401010022 |
6 | 1545211111203235032 |
7 | 60061411514516603 |
oct | 5536313564263374 |
9 | 866126531024152 |
10 | 200001021110012 |
11 | 587a9a58445421 |
12 | 1a521655378a78 |
13 | 877a0279aa7a5 |
14 | 375615b4a8a3a |
15 | 181c743a40592 |
hex | b5e65dd166fc |
200001021110012 has 12 divisors (see below), whose sum is σ = 362070814078680. Its totient is φ = 96552217087536.
The previous prime is 200001021110003. The next prime is 200001021110089. The reversal of 200001021110012 is 210011120100002.
It is a junction number, because it is equal to n+sod(n) for n = 200001021109975 and 200001021110002.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 862073366738 + ... + 862073366969.
It is an arithmetic number, because the mean of its divisors is an integer number (30172567839890).
Almost surely, 2200001021110012 is an apocalyptic number.
It is an amenable number.
200001021110012 is a deficient number, since it is larger than the sum of its proper divisors (162069792968668).
200001021110012 is a wasteful number, since it uses less digits than its factorization.
200001021110012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1724146733740 (or 1724146733738 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 200001021110012 its reverse (210011120100002), we get a palindrome (410012141210014).
The spelling of 200001021110012 in words is "two hundred trillion, one billion, twenty-one million, one hundred ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •