Base | Representation |
---|---|
bin | 101110100100010010… |
… | …1110010001000000001 |
3 | 100120010022121122100222 |
4 | 1131020211302020001 |
5 | 3114301020041001 |
6 | 113535040152425 |
7 | 10140100632641 |
oct | 1351045621001 |
9 | 316108548328 |
10 | 100002112001 |
11 | 39457648960 |
12 | 1746a608715 |
13 | 957909bb4c |
14 | 4ba9450521 |
15 | 290450561b |
hex | 1748972201 |
100002112001 has 8 divisors (see below), whose sum is σ = 110474140800. Its totient is φ = 89760237840.
The previous prime is 100002111991. The next prime is 100002112003. The reversal of 100002112001 is 100211200001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100002112001 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 100002112001.
It is not an unprimeable number, because it can be changed into a prime (100002112003) 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, 57537746 + ... + 57539483.
It is an arithmetic number, because the mean of its divisors is an integer number (13809267600).
Almost surely, 2100002112001 is an apocalyptic number.
100002112001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100002112001 is a deficient number, since it is larger than the sum of its proper divisors (10472028799).
100002112001 is a wasteful number, since it uses less digits than its factorization.
100002112001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 115077319.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 100002112001 its reverse (100211200001), we get a palindrome (200213312002).
The spelling of 100002112001 in words is "one hundred billion, two million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •