Base | Representation |
---|---|
bin | 101111000101101010… |
… | …1110111001111011001 |
3 | 100200000100220110112012 |
4 | 1132023111313033121 |
5 | 3124044213341441 |
6 | 114242123355305 |
7 | 10206616630604 |
oct | 1361325671731 |
9 | 320010813465 |
10 | 101122012121 |
11 | 39981815449 |
12 | 17721682b35 |
13 | 96c70c9640 |
14 | 4c7408d33b |
15 | 296c9bc9eb |
hex | 178b5773d9 |
101122012121 has 32 divisors (see below), whose sum is σ = 114244386816. Its totient is φ = 88864776000.
The previous prime is 101122012001. The next prime is 101122012151. The reversal of 101122012121 is 121210221101.
It is not a de Polignac number, because 101122012121 - 218 = 101121749977 is a prime.
It is a super-2 number, since 2×1011220121212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101122012096 and 101122012105.
It is not an unprimeable number, because it can be changed into a prime (101122012151) 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 in 31 ways as a sum of consecutive naturals, for example, 24595856 + ... + 24599966.
It is an arithmetic number, because the mean of its divisors is an integer number (3570137088).
Almost surely, 2101122012121 is an apocalyptic number.
It is an amenable number.
101122012121 is a deficient number, since it is larger than the sum of its proper divisors (13122374695).
101122012121 is a wasteful number, since it uses less digits than its factorization.
101122012121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5133.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101122012121 its reverse (121210221101), we get a palindrome (222332233222).
The spelling of 101122012121 in words is "one hundred one billion, one hundred twenty-two million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •