Base | Representation |
---|---|
bin | 10111000000111110100001… |
… | …111000001010111000000101 |
3 | 111021101202012212021200212102 |
4 | 113000332201320022320011 |
5 | 101231411041242334341 |
6 | 555140501423201445 |
7 | 30215030504564300 |
oct | 2700764170127005 |
9 | 437352185250772 |
10 | 101222210121221 |
11 | 2a286109835052 |
12 | b429661446285 |
13 | 44632a0c719c7 |
14 | 1add276d75b37 |
15 | ba804e291c9b |
hex | 5c0fa1e0ae05 |
101222210121221 has 24 divisors (see below), whose sum is σ = 117885002114880. Its totient is φ = 86661213576000.
The previous prime is 101222210121217. The next prime is 101222210121229. The reversal of 101222210121221 is 122121012222101.
It is not a de Polignac number, because 101222210121221 - 22 = 101222210121217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101222210121193 and 101222210121202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101222210121229) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 147167921 + ... + 147854121.
It is an arithmetic number, because the mean of its divisors is an integer number (4911875088120).
Almost surely, 2101222210121221 is an apocalyptic number.
It is an amenable number.
101222210121221 is a deficient number, since it is larger than the sum of its proper divisors (16662791993659).
101222210121221 is a wasteful number, since it uses less digits than its factorization.
101222210121221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 689705 (or 689698 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 101222210121221 its reverse (122121012222101), we get a palindrome (223343222343322).
The spelling of 101222210121221 in words is "one hundred one trillion, two hundred twenty-two billion, two hundred ten million, one hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •