Base | Representation |
---|---|
bin | 10110110000110011101110… |
… | …100100010001101000111001 |
3 | 111010110112020200222120112002 |
4 | 112300303232210101220321 |
5 | 101110210013124101014 |
6 | 552530223214030345 |
7 | 30041534250352112 |
oct | 2660635644215071 |
9 | 433415220876462 |
10 | 100111100222009 |
11 | 29997974203378 |
12 | b28a250aa83b5 |
13 | 43b2589570896 |
14 | 1aa1590191209 |
15 | b891bd293dde |
hex | 5b0cee911a39 |
100111100222009 has 2 divisors, whose sum is σ = 100111100222010. Its totient is φ = 100111100222008.
The previous prime is 100111100221997. The next prime is 100111100222041. The reversal of 100111100222009 is 900222001111001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 73867200727609 + 26243899494400 = 8594603^2 + 5122880^2 .
It is a cyclic number.
It is not a de Polignac number, because 100111100222009 - 224 = 100111083444793 is a prime.
It is a super-2 number, since 2×1001111002220092 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100111100222509) 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, 50055550111004 + 50055550111005.
It is an arithmetic number, because the mean of its divisors is an integer number (50055550111005).
Almost surely, 2100111100222009 is an apocalyptic number.
It is an amenable number.
100111100222009 is a deficient number, since it is larger than the sum of its proper divisors (1).
100111100222009 is an equidigital number, since it uses as much as digits as its factorization.
100111100222009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 20.
The spelling of 100111100222009 in words is "one hundred trillion, one hundred eleven billion, one hundred million, two hundred twenty-two thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •