Base | Representation |
---|---|
bin | 10110110000110010111001… |
… | …100100100010110101100111 |
3 | 111010110102221201221111102120 |
4 | 112300302321210202311213 |
5 | 101110201203020200012 |
6 | 552525555053041023 |
7 | 30041503233060513 |
oct | 2660627144426547 |
9 | 433412851844376 |
10 | 100110211100007 |
11 | 299975583308a9 |
12 | b28a043186173 |
13 | 43b24772b55a4 |
14 | 1aa1508067143 |
15 | b8916a1b558c |
hex | 5b0cb9922d67 |
100110211100007 has 8 divisors (see below), whose sum is σ = 133481043646080. Its totient is φ = 66739759643640.
The previous prime is 100110211099967. The next prime is 100110211100047. The reversal of 100110211100007 is 700001112011001.
It is an interprime number because it is at equal distance from previous prime (100110211099967) and next prime (100110211100047).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100110211100007 - 215 = 100110211067239 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100110211100047) 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, 94658907 + ... + 95710652.
It is an arithmetic number, because the mean of its divisors is an integer number (16685130455760).
Almost surely, 2100110211100007 is an apocalyptic number.
100110211100007 is a deficient number, since it is larger than the sum of its proper divisors (33370832546073).
100110211100007 is a wasteful number, since it uses less digits than its factorization.
100110211100007 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 190544853.
The product of its (nonzero) digits is 14, while the sum is 15.
Adding to 100110211100007 its reverse (700001112011001), we get a palindrome (800111323111008).
The spelling of 100110211100007 in words is "one hundred trillion, one hundred ten billion, two hundred eleven million, one hundred thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •