Base | Representation |
---|---|
bin | 10110110001000000111101… |
… | …100011001100101100011011 |
3 | 111010111212221000122100202121 |
4 | 112301000331203030230123 |
5 | 101110423113410212223 |
6 | 552540533232042111 |
7 | 30042546345465415 |
oct | 2661007543145433 |
9 | 433455830570677 |
10 | 100125310241563 |
11 | 299a29a6408392 |
12 | b290b57993337 |
13 | 43b3a12534489 |
14 | 1aa213b4d79b5 |
15 | b89750a6015d |
hex | 5b103d8ccb1b |
100125310241563 has 2 divisors, whose sum is σ = 100125310241564. Its totient is φ = 100125310241562.
The previous prime is 100125310241503. The next prime is 100125310241573. The reversal of 100125310241563 is 365142013521001.
It is a strong prime.
It is an emirp because it is prime and its reverse (365142013521001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100125310241563 - 225 = 100125276687131 is a prime.
It is not a weakly prime, because it can be changed into another prime (100125310241503) 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, 50062655120781 + 50062655120782.
It is an arithmetic number, because the mean of its divisors is an integer number (50062655120782).
Almost surely, 2100125310241563 is an apocalyptic number.
100125310241563 is a deficient number, since it is larger than the sum of its proper divisors (1).
100125310241563 is an equidigital number, since it uses as much as digits as its factorization.
100125310241563 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21600, while the sum is 34.
Adding to 100125310241563 its reverse (365142013521001), we get a palindrome (465267323762564).
The spelling of 100125310241563 in words is "one hundred trillion, one hundred twenty-five billion, three hundred ten million, two hundred forty-one thousand, five hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •