Base | Representation |
---|---|
bin | 10110110000101001110110… |
… | …110000000010011101100111 |
3 | 111010102111212221222211201011 |
4 | 112300221312300002131213 |
5 | 101110021311011330223 |
6 | 552521311312443051 |
7 | 30041010465013063 |
oct | 2660516660023547 |
9 | 433374787884634 |
10 | 100100500105063 |
11 | 29993424770647 |
12 | b288192b49487 |
13 | 43b158a446533 |
14 | 1aa0c66454aa3 |
15 | b88c9c89380d |
hex | 5b0a76c02767 |
100100500105063 has 2 divisors, whose sum is σ = 100100500105064. Its totient is φ = 100100500105062.
The previous prime is 100100500105027. The next prime is 100100500105121. The reversal of 100100500105063 is 360501005001001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100100500105063 - 213 = 100100500096871 is a prime.
It is a super-2 number, since 2×1001005001050632 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100100500105013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50050250052531 + 50050250052532.
It is an arithmetic number, because the mean of its divisors is an integer number (50050250052532).
Almost surely, 2100100500105063 is an apocalyptic number.
100100500105063 is a deficient number, since it is larger than the sum of its proper divisors (1).
100100500105063 is an equidigital number, since it uses as much as digits as its factorization.
100100500105063 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 450, while the sum is 22.
Adding to 100100500105063 its reverse (360501005001001), we get a palindrome (460601505106064).
The spelling of 100100500105063 in words is "one hundred trillion, one hundred billion, five hundred million, one hundred five thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •