Base | Representation |
---|---|
bin | 101101011110011001100011… |
… | …001111000110110100010001 |
3 | 222020010220211101002000112000 |
4 | 231132121203033012310101 |
5 | 202203304234133310001 |
6 | 1545211124211424213 |
7 | 60061414000251261 |
oct | 5536314317066421 |
9 | 866126741060460 |
10 | 200001112010001 |
11 | 587a9aa4790985 |
12 | 1a52167b8b5069 |
13 | 877a040786273 |
14 | 37561695ab7a1 |
15 | 181c74b9e8a86 |
hex | b5e6633c6d11 |
200001112010001 has 32 divisors (see below), whose sum is σ = 298925252496000. Its totient is φ = 132155618120640.
The previous prime is 200001112009999. The next prime is 200001112010009. The reversal of 200001112010001 is 100010211100002.
It is a happy number.
It is not a de Polignac number, because 200001112010001 - 21 = 200001112009999 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (200001112010009) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 51348690 + ... + 55106171.
It is an arithmetic number, because the mean of its divisors is an integer number (9341414140500).
Almost surely, 2200001112010001 is an apocalyptic number.
It is an amenable number.
200001112010001 is a deficient number, since it is larger than the sum of its proper divisors (98924140485999).
200001112010001 is a wasteful number, since it uses less digits than its factorization.
200001112010001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106455486 (or 106455480 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 200001112010001 its reverse (100010211100002), we get a palindrome (300011323110003).
Subtracting from 200001112010001 its reverse (100010211100002), we obtain a palindrome (99990900909999).
The spelling of 200001112010001 in words is "two hundred trillion, one billion, one hundred twelve million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •