Base | Representation |
---|---|
bin | 10010110111101111… |
… | …00010101011100100 |
3 | 222011001200100210120 |
4 | 21123313202223210 |
5 | 131222043034340 |
6 | 4353151121540 |
7 | 506026650051 |
oct | 113367425344 |
9 | 28131610716 |
10 | 10131221220 |
11 | 43298a04aa |
12 | 1b68b132b0 |
13 | c55c42a73 |
14 | 6c1760028 |
15 | 3e467d4d0 |
hex | 25bde2ae4 |
10131221220 has 48 divisors (see below), whose sum is σ = 28371809088. Its totient is φ = 2701240960.
The previous prime is 10131221207. The next prime is 10131221231. The reversal of 10131221220 is 2212213101.
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 10131221220.
It is an unprimeable number.
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 in 15 ways as a sum of consecutive naturals, for example, 695815 + ... + 710225.
It is an arithmetic number, because the mean of its divisors is an integer number (591079356).
Almost surely, 210131221220 is an apocalyptic number.
10131221220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10131221220 is an abundant number, since it is smaller than the sum of its proper divisors (18240587868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10131221220 is a wasteful number, since it uses less digits than its factorization.
10131221220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26140 (or 26138 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 10131221220 its reverse (2212213101), we get a palindrome (12343434321).
The spelling of 10131221220 in words is "ten billion, one hundred thirty-one million, two hundred twenty-one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •