Base | Representation |
---|---|
bin | 1001000110000101010110… |
… | …1110000101110111100111 |
3 | 1022102000001200211001121102 |
4 | 2101201111232011313213 |
5 | 2302320222213323421 |
6 | 33133554224110315 |
7 | 2051325226412651 |
oct | 221412556056747 |
9 | 38360050731542 |
10 | 10000122011111 |
11 | 3206034199851 |
12 | 115611076539b |
13 | 57701350794b |
14 | 26801940d6d1 |
15 | 1251d59e460b |
hex | 91855b85de7 |
10000122011111 has 2 divisors, whose sum is σ = 10000122011112. Its totient is φ = 10000122011110.
The previous prime is 10000122011107. The next prime is 10000122011179. The reversal of 10000122011111 is 11111022100001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10000122011111 - 22 = 10000122011107 is a prime.
It is a super-2 number, since 2×100001220111112 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10000122011092 and 10000122011101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10000122011311) 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, 5000061005555 + 5000061005556.
It is an arithmetic number, because the mean of its divisors is an integer number (5000061005556).
Almost surely, 210000122011111 is an apocalyptic number.
10000122011111 is a deficient number, since it is larger than the sum of its proper divisors (1).
10000122011111 is an equidigital number, since it uses as much as digits as its factorization.
10000122011111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10000122011111 its reverse (11111022100001), we get a palindrome (21111144111112).
The spelling of 10000122011111 in words is "ten trillion, one hundred twenty-two million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •