Base | Representation |
---|---|
bin | 10110110000101110111111… |
… | …001010110101010101001011 |
3 | 111010110001002221221100110111 |
4 | 112300232333022311111023 |
5 | 101110114102033243021 |
6 | 552524022142055151 |
7 | 30041264151561031 |
oct | 2660567712652513 |
9 | 433401087840414 |
10 | 100106010056011 |
11 | 299957a1a11313 |
12 | b28927027a4b7 |
13 | 43b1c57b3263b |
14 | 1aa122a13c551 |
15 | b88ec147b8e1 |
hex | 5b0bbf2b554b |
100106010056011 has 8 divisors (see below), whose sum is σ = 105374878994000. Its totient is φ = 94837154274720.
The previous prime is 100106010055999. The next prime is 100106010056023. The reversal of 100106010056011 is 110650010601001.
It is an interprime number because it is at equal distance from previous prime (100106010055999) and next prime (100106010056023).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100106010056011 - 223 = 100106001667403 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100106010056911) 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, 14911141 + ... + 20556121.
It is an arithmetic number, because the mean of its divisors is an integer number (13171859874250).
Almost surely, 2100106010056011 is an apocalyptic number.
100106010056011 is a deficient number, since it is larger than the sum of its proper divisors (5268868937989).
100106010056011 is an equidigital number, since it uses as much as digits as its factorization.
100106010056011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6578349.
The product of its (nonzero) digits is 180, while the sum is 22.
Adding to 100106010056011 its reverse (110650010601001), we get a palindrome (210756020657012).
The spelling of 100106010056011 in words is "one hundred trillion, one hundred six billion, ten million, fifty-six thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •