Base | Representation |
---|---|
bin | 101110101011011101… |
… | …0001000010101001101 |
3 | 100120202001121211012122 |
4 | 1131112322020111031 |
5 | 3120244013424421 |
6 | 114014540542325 |
7 | 10146045501545 |
oct | 1352672102515 |
9 | 316661554178 |
10 | 100242326861 |
11 | 395701a8936 |
12 | 17516b519a5 |
13 | 95b6a96711 |
14 | 4bcd300325 |
15 | 291a6552ab |
hex | 1756e8854d |
100242326861 has 2 divisors, whose sum is σ = 100242326862. Its totient is φ = 100242326860.
The previous prime is 100242326843. The next prime is 100242326881. The reversal of 100242326861 is 168623242001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 93321085225 + 6921241636 = 305485^2 + 83194^2 .
It is a cyclic number.
It is not a de Polignac number, because 100242326861 - 230 = 99168585037 is a prime.
It is a super-2 number, since 2×1002423268612 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100242326881) 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, 50121163430 + 50121163431.
It is an arithmetic number, because the mean of its divisors is an integer number (50121163431).
Almost surely, 2100242326861 is an apocalyptic number.
It is an amenable number.
100242326861 is a deficient number, since it is larger than the sum of its proper divisors (1).
100242326861 is an equidigital number, since it uses as much as digits as its factorization.
100242326861 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27648, while the sum is 35.
Adding to 100242326861 its reverse (168623242001), we get a palindrome (268865568862).
The spelling of 100242326861 in words is "one hundred billion, two hundred forty-two million, three hundred twenty-six thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •