Base | Representation |
---|---|
bin | 10110101111111011010101… |
… | …011111101110010001000001 |
3 | 111010020201221212011102220001 |
4 | 112233323111133232101001 |
5 | 101103212011303243001 |
6 | 552442331013520001 |
7 | 30034261620421636 |
oct | 2657732537562101 |
9 | 433221855142801 |
10 | 100050550056001 |
11 | 29974222215466 |
12 | b27a572943001 |
13 | 43a9959b4579c |
14 | 1a9c68860818d |
15 | b878275b9001 |
hex | 5afed57ee441 |
100050550056001 has 2 divisors, whose sum is σ = 100050550056002. Its totient is φ = 100050550056000.
The previous prime is 100050550055983. The next prime is 100050550056007. The reversal of 100050550056001 is 100650055050001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96677171327025 + 3373378728976 = 9832455^2 + 1836676^2 .
It is an emirp because it is prime and its reverse (100650055050001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100050550056001 - 25 = 100050550055969 is a prime.
It is a super-2 number, since 2×1000505500560012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100050550056007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50025275028000 + 50025275028001.
It is an arithmetic number, because the mean of its divisors is an integer number (50025275028001).
Almost surely, 2100050550056001 is an apocalyptic number.
It is an amenable number.
100050550056001 is a deficient number, since it is larger than the sum of its proper divisors (1).
100050550056001 is an equidigital number, since it uses as much as digits as its factorization.
100050550056001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3750, while the sum is 28.
The spelling of 100050550056001 in words is "one hundred trillion, fifty billion, five hundred fifty million, fifty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •