Base | Representation |
---|---|
bin | 10110110010000110100111… |
… | …011100000110101101111001 |
3 | 111010210000222100001021011201 |
4 | 112302012213130012231321 |
5 | 101113134301402223001 |
6 | 553035142510054201 |
7 | 30051134626314121 |
oct | 2662064734065571 |
9 | 433700870037151 |
10 | 100200101211001 |
11 | 29a21695a16730 |
12 | b2a354b1aa361 |
13 | 43baaa1410b8c |
14 | 1aa59d451bc81 |
15 | b8b67ba87501 |
hex | 5b21a7706b79 |
100200101211001 has 8 divisors (see below), whose sum is σ = 109310157468864. Its totient is φ = 91090204311120.
The previous prime is 100200101210953. The next prime is 100200101211013. The reversal of 100200101211001 is 100112101002001.
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-100200101211001 is a prime.
It is not an unprimeable number, because it can be changed into a prime (100200101211031) 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, 38522890 + ... + 41041603.
It is an arithmetic number, because the mean of its divisors is an integer number (13663769683608).
Almost surely, 2100200101211001 is an apocalyptic number.
100200101211001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100200101211001 is a deficient number, since it is larger than the sum of its proper divisors (9110056257863).
100200101211001 is a wasteful number, since it uses less digits than its factorization.
100200101211001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79678991.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 100200101211001 its reverse (100112101002001), we get a palindrome (200312202213002).
The spelling of 100200101211001 in words is "one hundred trillion, two hundred billion, one hundred one million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •