Base | Representation |
---|---|
bin | 10110101111010110100110… |
… | …000110001000010010100111 |
3 | 111010002222010112010122102102 |
4 | 112233112212012020102213 |
5 | 101102040213112041124 |
6 | 552412244244402315 |
7 | 30031364202425024 |
oct | 2657264606102247 |
9 | 433088115118372 |
10 | 100011100112039 |
11 | 29959518802696 |
12 | b2729a30a639b |
13 | 43a6010a2308c |
14 | 1a9a7c510254b |
15 | b867b9036aae |
hex | 5af5a61884a7 |
100011100112039 has 2 divisors, whose sum is σ = 100011100112040. Its totient is φ = 100011100112038.
The previous prime is 100011100111999. The next prime is 100011100112041. The reversal of 100011100112039 is 930211001110001.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100011100112039 - 212 = 100011100107943 is a prime.
Together with 100011100112041, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100011100112039.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100011100112069) 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, 50005550056019 + 50005550056020.
It is an arithmetic number, because the mean of its divisors is an integer number (50005550056020).
Almost surely, 2100011100112039 is an apocalyptic number.
100011100112039 is a deficient number, since it is larger than the sum of its proper divisors (1).
100011100112039 is an equidigital number, since it uses as much as digits as its factorization.
100011100112039 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 20.
The spelling of 100011100112039 in words is "one hundred trillion, eleven billion, one hundred million, one hundred twelve thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •