Base | Representation |
---|---|
bin | 10110111111100001010100… |
… | …000010101010100111011011 |
3 | 111021001011212102001211022012 |
4 | 112333201110002222213123 |
5 | 101223241100210031021 |
6 | 555022505520420135 |
7 | 30204555254605463 |
oct | 2677412402524733 |
9 | 437034772054265 |
10 | 101122120002011 |
11 | 2a247717547069 |
12 | b41218947764b |
13 | 4456a0c89acb4 |
14 | 1ad849dd76ba3 |
15 | ba56421a535b |
hex | 5bf8540aa9db |
101122120002011 has 2 divisors, whose sum is σ = 101122120002012. Its totient is φ = 101122120002010.
The previous prime is 101122120001999. The next prime is 101122120002049. The reversal of 101122120002011 is 110200021221101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101122120002011 - 210 = 101122120000987 is a prime.
It is a super-2 number, since 2×1011221200020112 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101122120002311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50561060001005 + 50561060001006.
It is an arithmetic number, because the mean of its divisors is an integer number (50561060001006).
Almost surely, 2101122120002011 is an apocalyptic number.
101122120002011 is a deficient number, since it is larger than the sum of its proper divisors (1).
101122120002011 is an equidigital number, since it uses as much as digits as its factorization.
101122120002011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101122120002011 its reverse (110200021221101), we get a palindrome (211322141223112).
The spelling of 101122120002011 in words is "one hundred one trillion, one hundred twenty-two billion, one hundred twenty million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.696 sec. • engine limits •