Base | Representation |
---|---|
bin | 1001010011000000010101… |
… | …0111000101001011110100 |
3 | 1100012020001120100001121111 |
4 | 2110300011113011023310 |
5 | 2314434341144213413 |
6 | 33423550134124404 |
7 | 2103344316142345 |
oct | 224600527051364 |
9 | 40166046301544 |
10 | 10222112101108 |
11 | 329119a878046 |
12 | 11911447b0704 |
13 | 591c305b919b |
14 | 274a77c120cc |
15 | 12ad7978ad3d |
hex | 94c055c52f4 |
10222112101108 has 6 divisors (see below), whose sum is σ = 17888696176946. Its totient is φ = 5111056050552.
The previous prime is 10222112101037. The next prime is 10222112101109. The reversal of 10222112101108 is 80110121122201.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 8873475830244 + 1348636270864 = 2978838^2 + 1161308^2 .
It is a super-2 number, since 2×102221121011082 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10222112101109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1277764012635 + ... + 1277764012642.
Almost surely, 210222112101108 is an apocalyptic number.
It is an amenable number.
10222112101108 is a deficient number, since it is larger than the sum of its proper divisors (7666584075838).
10222112101108 is a wasteful number, since it uses less digits than its factorization.
10222112101108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2555528025281 (or 2555528025279 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 22.
Adding to 10222112101108 its reverse (80110121122201), we get a palindrome (90332233223309).
The spelling of 10222112101108 in words is "ten trillion, two hundred twenty-two billion, one hundred twelve million, one hundred one thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •