Base | Representation |
---|---|
bin | 1001010010111111111111… |
… | …1111110000100011100101 |
3 | 1100012012211021222120222100 |
4 | 2110233333333300203211 |
5 | 2314434200124214341 |
6 | 33423533201122313 |
7 | 2103342144150120 |
oct | 224577777604345 |
9 | 40165737876870 |
10 | 10222022101221 |
11 | 3291153a96877 |
12 | 119111a629399 |
13 | 591c17a67308 |
14 | 274a69ca53b7 |
15 | 12ad7190e3b6 |
hex | 94bffff08e5 |
10222022101221 has 24 divisors (see below), whose sum is σ = 16904001692864. Its totient is φ = 5830925771520.
The previous prime is 10222022101183. The next prime is 10222022101231. The reversal of 10222022101221 is 12210122022201.
It is a happy number.
10222022101221 is a `hidden beast` number, since 1 + 0 + 2 + 220 + 221 + 0 + 1 + 221 = 666.
It is not a de Polignac number, because 10222022101221 - 29 = 10222022100709 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10222022101194 and 10222022101203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10222022101231) 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, 142043116 + ... + 142115061.
Almost surely, 210222022101221 is an apocalyptic number.
It is an amenable number.
10222022101221 is a deficient number, since it is larger than the sum of its proper divisors (6681979591643).
10222022101221 is a wasteful number, since it uses less digits than its factorization.
10222022101221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 284158761 (or 284158758 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 10222022101221 its reverse (12210122022201), we get a palindrome (22432144123422).
The spelling of 10222022101221 in words is "ten trillion, two hundred twenty-two billion, twenty-two million, one hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •