Base | Representation |
---|---|
bin | 10110110101010101000001… |
… | …000111110011110010100101 |
3 | 111011120020000112101021011022 |
4 | 112311111001013303302211 |
5 | 101130302142031221312 |
6 | 553325034100220525 |
7 | 30103141623566024 |
oct | 2665250107636245 |
9 | 434506015337138 |
10 | 100421722913957 |
11 | 29aa7682661325 |
12 | b31a49b99a745 |
13 | 440596009c013 |
14 | 1ab261a0288bb |
15 | b922ed312172 |
hex | 5b55411f3ca5 |
100421722913957 has 2 divisors, whose sum is σ = 100421722913958. Its totient is φ = 100421722913956.
The previous prime is 100421722913903. The next prime is 100421722913977. The reversal of 100421722913957 is 759319227124001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 93020025906721 + 7401697007236 = 9644689^2 + 2720606^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100421722913957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100421722913899 and 100421722913908.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100421722913977) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50210861456978 + 50210861456979.
It is an arithmetic number, because the mean of its divisors is an integer number (50210861456979).
Almost surely, 2100421722913957 is an apocalyptic number.
It is an amenable number.
100421722913957 is a deficient number, since it is larger than the sum of its proper divisors (1).
100421722913957 is an equidigital number, since it uses as much as digits as its factorization.
100421722913957 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1905120, while the sum is 53.
The spelling of 100421722913957 in words is "one hundred trillion, four hundred twenty-one billion, seven hundred twenty-two million, nine hundred thirteen thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •