Base | Representation |
---|---|
bin | 101110110100110010… |
… | …0100001110101110001 |
3 | 100121112212210011201122 |
4 | 1131221210201311301 |
5 | 3121414142300111 |
6 | 114110003512025 |
7 | 10156600030454 |
oct | 1355144416561 |
9 | 317485704648 |
10 | 100555431281 |
11 | 39710a12918 |
12 | 175a3988615 |
13 | 96369020c6 |
14 | 4c1cb2549b |
15 | 2937da1cdb |
hex | 1769921d71 |
100555431281 has 2 divisors, whose sum is σ = 100555431282. Its totient is φ = 100555431280.
The previous prime is 100555431257. The next prime is 100555431373. The reversal of 100555431281 is 182134555001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 61357767025 + 39197664256 = 247705^2 + 197984^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100555431281 is a prime.
It is a super-2 number, since 2×1005554312812 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100555431481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50277715640 + 50277715641.
It is an arithmetic number, because the mean of its divisors is an integer number (50277715641).
Almost surely, 2100555431281 is an apocalyptic number.
It is an amenable number.
100555431281 is a deficient number, since it is larger than the sum of its proper divisors (1).
100555431281 is an equidigital number, since it uses as much as digits as its factorization.
100555431281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24000, while the sum is 35.
Adding to 100555431281 its reverse (182134555001), we get a palindrome (282689986282).
The spelling of 100555431281 in words is "one hundred billion, five hundred fifty-five million, four hundred thirty-one thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •