Base | Representation |
---|---|
bin | 10110111111100000010010… |
… | …100110100101010011111011 |
3 | 111021001002000220012200222100 |
4 | 112333200102212211103323 |
5 | 101223231323130334321 |
6 | 555022204541154443 |
7 | 30204516124020021 |
oct | 2677402246452373 |
9 | 437032026180870 |
10 | 101121022121211 |
11 | 2a247203849a64 |
12 | b411b2185ba23 |
13 | 44568962acaa1 |
14 | 1ad83d822a711 |
15 | ba55caadc326 |
hex | 5bf8129a54fb |
101121022121211 has 6 divisors (see below), whose sum is σ = 146063698619540. Its totient is φ = 67414014747468.
The previous prime is 101121022121173. The next prime is 101121022121233. The reversal of 101121022121211 is 112121220121101.
It is a happy number.
101121022121211 is a `hidden beast` number, since 1 + 0 + 1 + 1 + 210 + 221 + 21 + 211 = 666.
It is not a de Polignac number, because 101121022121211 - 241 = 98921998865659 is a prime.
It is a super-2 number, since 2×1011210221212112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101121022121291) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5617834562281 + ... + 5617834562298.
Almost surely, 2101121022121211 is an apocalyptic number.
101121022121211 is a deficient number, since it is larger than the sum of its proper divisors (44942676498329).
101121022121211 is a wasteful number, since it uses less digits than its factorization.
101121022121211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11235669124585 (or 11235669124582 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 101121022121211 its reverse (112121220121101), we get a palindrome (213242242242312).
The spelling of 101121022121211 in words is "one hundred one trillion, one hundred twenty-one billion, twenty-two million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •