Base | Representation |
---|---|
bin | 10110110000110011101111… |
… | …110100010011001101111101 |
3 | 111010110112022011110100220121 |
4 | 112300303233310103031331 |
5 | 101110210034011344442 |
6 | 552530225243414541 |
7 | 30041534623563325 |
oct | 2660635764231575 |
9 | 433415264410817 |
10 | 100111121199997 |
11 | 29997985031456 |
12 | b28a257b24451 |
13 | 43b2590a071ab |
14 | 1aa1592c92285 |
15 | b891c0039967 |
hex | 5b0cefd1337d |
100111121199997 has 2 divisors, whose sum is σ = 100111121199998. Its totient is φ = 100111121199996.
The previous prime is 100111121199977. The next prime is 100111121200049. The reversal of 100111121199997 is 799991121111001.
It is an a-pointer prime, because the next prime (100111121200049) can be obtained adding 100111121199997 to its sum of digits (52).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 58578909386596 + 41532211813401 = 7653686^2 + 6444549^2 .
It is a cyclic number.
It is not a de Polignac number, because 100111121199997 - 223 = 100111112811389 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100111121199977) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50055560599998 + 50055560599999.
It is an arithmetic number, because the mean of its divisors is an integer number (50055560599999).
Almost surely, 2100111121199997 is an apocalyptic number.
It is an amenable number.
100111121199997 is a deficient number, since it is larger than the sum of its proper divisors (1).
100111121199997 is an equidigital number, since it uses as much as digits as its factorization.
100111121199997 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 91854, while the sum is 52.
The spelling of 100111121199997 in words is "one hundred trillion, one hundred eleven billion, one hundred twenty-one million, one hundred ninety-nine thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •