Base | Representation |
---|---|
bin | 10110111111100001011010… |
… | …000111110011011011011001 |
3 | 111021001012010112000110212102 |
4 | 112333201122013303123121 |
5 | 101223241302313341441 |
6 | 555022524003053145 |
7 | 30204560633642162 |
oct | 2677413207633331 |
9 | 437035115013772 |
10 | 101122222012121 |
11 | 2a24776a090842 |
12 | b4121b76711b5 |
13 | 4456a27a666cb |
14 | 1ad84ad72c769 |
15 | ba564b10569b |
hex | 5bf85a1f36d9 |
101122222012121 has 16 divisors (see below), whose sum is σ = 108920393791488. Its totient is φ = 93532295328000.
The previous prime is 101122222012069. The next prime is 101122222012199. The reversal of 101122222012121 is 121210222221101.
It is a cyclic number.
It is not a de Polignac number, because 101122222012121 - 230 = 101121148270297 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101122222012093 and 101122222012102.
It is not an unprimeable number, because it can be changed into a prime (101122222011121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 41167055 + ... + 43554228.
It is an arithmetic number, because the mean of its divisors is an integer number (6807524611968).
Almost surely, 2101122222012121 is an apocalyptic number.
It is an amenable number.
101122222012121 is a deficient number, since it is larger than the sum of its proper divisors (7798171779367).
101122222012121 is a wasteful number, since it uses less digits than its factorization.
101122222012121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84722512.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 101122222012121 its reverse (121210222221101), we get a palindrome (222332444233222).
The spelling of 101122222012121 in words is "one hundred one trillion, one hundred twenty-two billion, two hundred twenty-two million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •