Base | Representation |
---|---|
bin | 10110110000111101111000… |
… | …011100001110011011100001 |
3 | 111010111120101120001102122201 |
4 | 112300331320130032123201 |
5 | 101110344330321131423 |
6 | 552535225140533201 |
7 | 30042401402121502 |
oct | 2660757034163341 |
9 | 433446346042581 |
10 | 100122003302113 |
11 | 299a1559763881 |
12 | b2903943b1201 |
13 | 43b3606392680 |
14 | 1aa1d06232ba9 |
15 | b8960a58b2ad |
hex | 5b0f7870e6e1 |
100122003302113 has 16 divisors (see below), whose sum is σ = 109163818693440. Its totient is φ = 91272471626304.
The previous prime is 100122003302107. The next prime is 100122003302117. The reversal of 100122003302113 is 311203300221001.
It is a cyclic number.
It is not a de Polignac number, because 100122003302113 - 221 = 100122001204961 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100122003302117) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14579506 + ... + 20317627.
It is an arithmetic number, because the mean of its divisors is an integer number (6822738668340).
Almost surely, 2100122003302113 is an apocalyptic number.
100122003302113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
100122003302113 is a deficient number, since it is larger than the sum of its proper divisors (9041815391327).
100122003302113 is a wasteful number, since it uses less digits than its factorization.
100122003302113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34899888.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 100122003302113 its reverse (311203300221001), we get a palindrome (411325303523114).
The spelling of 100122003302113 in words is "one hundred trillion, one hundred twenty-two billion, three million, three hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •