Base | Representation |
---|---|
bin | 11101011001011110101… |
… | …11111100110101101100 |
3 | 10120120021110011110101020 |
4 | 32230233113330311230 |
5 | 113022202200402340 |
6 | 2052012240214140 |
7 | 132656343241635 |
oct | 16545727746554 |
9 | 3516243143336 |
10 | 1010112122220 |
11 | 35a427a60aa3 |
12 | 14392460a350 |
13 | 7433a282306 |
14 | 36c6543488c |
15 | 1b41e3c09d0 |
hex | eb2f5fcd6c |
1010112122220 has 24 divisors (see below), whose sum is σ = 2828313942384. Its totient is φ = 269363232576.
The previous prime is 1010112122219. The next prime is 1010112122249. The reversal of 1010112122220 is 222212110101.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1010112122220.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8417600959 + ... + 8417601078.
It is an arithmetic number, because the mean of its divisors is an integer number (117846414266).
Almost surely, 21010112122220 is an apocalyptic number.
1010112122220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1010112122220 is an abundant number, since it is smaller than the sum of its proper divisors (1818201820164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010112122220 is a wasteful number, since it uses less digits than its factorization.
1010112122220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16835202049 (or 16835202047 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1010112122220 its reverse (222212110101), we get a palindrome (1232324232321).
The spelling of 1010112122220 in words is "one trillion, ten billion, one hundred twelve million, one hundred twenty-two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •