Base | Representation |
---|---|
bin | 10110110111001101011101… |
… | …111010110011000011101011 |
3 | 111012000120211220122002001211 |
4 | 112313031131322303003223 |
5 | 101134412030043424402 |
6 | 553504303401053551 |
7 | 30115400610652621 |
oct | 2667153572630353 |
9 | 435016756562054 |
10 | 100551055061227 |
11 | 2a047510248851 |
12 | b33b574a872b7 |
13 | 4414c017ab904 |
14 | 1ab89a8927511 |
15 | b9586c7034d7 |
hex | 5b735deb30eb |
100551055061227 has 2 divisors, whose sum is σ = 100551055061228. Its totient is φ = 100551055061226.
The previous prime is 100551055061089. The next prime is 100551055061309. The reversal of 100551055061227 is 722160550155001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100551055061227 - 223 = 100551046672619 is a prime.
It is a super-2 number, since 2×1005510550612272 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 100551055061227.
It is not a weakly prime, because it can be changed into another prime (100551055061027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50275527530613 + 50275527530614.
It is an arithmetic number, because the mean of its divisors is an integer number (50275527530614).
Almost surely, 2100551055061227 is an apocalyptic number.
100551055061227 is a deficient number, since it is larger than the sum of its proper divisors (1).
100551055061227 is an equidigital number, since it uses as much as digits as its factorization.
100551055061227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 105000, while the sum is 40.
The spelling of 100551055061227 in words is "one hundred trillion, five hundred fifty-one billion, fifty-five million, sixty-one thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •