Base | Representation |
---|---|
bin | 10110110111001101011101… |
… | …111110011010110101000011 |
3 | 111012000120211222102022022102 |
4 | 112313031131332122311003 |
5 | 101134412030314314223 |
6 | 553504303433301015 |
7 | 30115400622015434 |
oct | 2667153576326503 |
9 | 435016758368272 |
10 | 100551056010563 |
11 | 2a047510837024 |
12 | b33b57526476b |
13 | 4414c01a51a52 |
14 | 1ab89a8ad348b |
15 | b9586c83e928 |
hex | 5b735df9ad43 |
100551056010563 has 2 divisors, whose sum is σ = 100551056010564. Its totient is φ = 100551056010562.
The previous prime is 100551056010511. The next prime is 100551056010653. The reversal of 100551056010563 is 365010650155001.
Together with next prime (100551056010653) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100551056010563 - 26 = 100551056010499 is a prime.
It is a super-2 number, since 2×1005510560105632 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100551056010263) 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, 50275528005281 + 50275528005282.
It is an arithmetic number, because the mean of its divisors is an integer number (50275528005282).
Almost surely, 2100551056010563 is an apocalyptic number.
100551056010563 is a deficient number, since it is larger than the sum of its proper divisors (1).
100551056010563 is an equidigital number, since it uses as much as digits as its factorization.
100551056010563 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 67500, while the sum is 38.
The spelling of 100551056010563 in words is "one hundred trillion, five hundred fifty-one billion, fifty-six million, ten thousand, five hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •