Base | Representation |
---|---|
bin | 10110101111001101010010… |
… | …000011001001100010100111 |
3 | 111010002000022121100220111012 |
4 | 112233031102003021202213 |
5 | 101101404223112004431 |
6 | 552403512101532435 |
7 | 30030561325004063 |
oct | 2657152203114247 |
9 | 433060277326435 |
10 | 100001100109991 |
11 | 29955256a97093 |
12 | b270a7211411b |
13 | 43a50a90349c2 |
14 | 1a9a116d7caa3 |
15 | b863d117822b |
hex | 5af3520c98a7 |
100001100109991 has 2 divisors, whose sum is σ = 100001100109992. Its totient is φ = 100001100109990.
The previous prime is 100001100109973. The next prime is 100001100110057. The reversal of 100001100109991 is 199901001100001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100001100109991 - 210 = 100001100108967 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100001100109931) 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, 50000550054995 + 50000550054996.
It is an arithmetic number, because the mean of its divisors is an integer number (50000550054996).
Almost surely, 2100001100109991 is an apocalyptic number.
100001100109991 is a deficient number, since it is larger than the sum of its proper divisors (1).
100001100109991 is an equidigital number, since it uses as much as digits as its factorization.
100001100109991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 729, while the sum is 32.
Adding to 100001100109991 its reverse (199901001100001), we get a palindrome (299902101209992).
The spelling of 100001100109991 in words is "one hundred trillion, one billion, one hundred million, one hundred nine thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •