Base | Representation |
---|---|
bin | 11101101111110110011… |
… | …01111111111011110001 |
3 | 10121201021102212110122120 |
4 | 32313323031333323301 |
5 | 113221301213000423 |
6 | 2101320101424453 |
7 | 133563064436124 |
oct | 16677315777361 |
9 | 3551242773576 |
10 | 1022122000113 |
11 | 36453024a015 |
12 | 14611670b129 |
13 | 75502494c36 |
14 | 376844a43bb |
15 | 1b8c3942ee3 |
hex | edfb37fef1 |
1022122000113 has 8 divisors (see below), whose sum is σ = 1406791570176. Its totient is φ = 659433548400.
The previous prime is 1022122000073. The next prime is 1022122000157. The reversal of 1022122000113 is 3110002212201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1022122000113 - 29 = 1022121999601 is a prime.
It is a super-2 number, since 2×10221220001132 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1022122000092 and 1022122000101.
It is not an unprimeable number, because it can be changed into a prime (1022122002113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5495279478 + ... + 5495279663.
It is an arithmetic number, because the mean of its divisors is an integer number (175848946272).
Almost surely, 21022122000113 is an apocalyptic number.
It is an amenable number.
1022122000113 is a deficient number, since it is larger than the sum of its proper divisors (384669570063).
1022122000113 is a wasteful number, since it uses less digits than its factorization.
1022122000113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10990559175.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1022122000113 its reverse (3110002212201), we get a palindrome (4132124212314).
The spelling of 1022122000113 in words is "one trillion, twenty-two billion, one hundred twenty-two million, one hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •