Base | Representation |
---|---|
bin | 10110110111111011000011… |
… | …100110000111001101100001 |
3 | 111012012021012100121210212012 |
4 | 112313323003212013031201 |
5 | 101141212302410230131 |
6 | 553543000552042305 |
7 | 30122052630204566 |
oct | 2667730346071541 |
9 | 435167170553765 |
10 | 100600005555041 |
11 | 2a06624a554313 |
12 | b348b56393395 |
13 | 4419702c99a55 |
14 | 1abb0cdb0086d |
15 | b96c84d8852b |
hex | 5b7ec3987361 |
100600005555041 has 2 divisors, whose sum is σ = 100600005555042. Its totient is φ = 100600005555040.
The previous prime is 100600005555037. The next prime is 100600005555059. The reversal of 100600005555041 is 140555500006001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 77529275315041 + 23070730240000 = 8805071^2 + 4803200^2 .
It is a cyclic number.
It is not a de Polignac number, because 100600005555041 - 22 = 100600005555037 is a prime.
It is a super-2 number, since 2×1006000055550412 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100600005554989 and 100600005555007.
It is not a weakly prime, because it can be changed into another prime (100600005555241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50300002777520 + 50300002777521.
It is an arithmetic number, because the mean of its divisors is an integer number (50300002777521).
Almost surely, 2100600005555041 is an apocalyptic number.
It is an amenable number.
100600005555041 is a deficient number, since it is larger than the sum of its proper divisors (1).
100600005555041 is an equidigital number, since it uses as much as digits as its factorization.
100600005555041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15000, while the sum is 32.
The spelling of 100600005555041 in words is "one hundred trillion, six hundred billion, five million, five hundred fifty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •