Base | Representation |
---|---|
bin | 11110000000101000010… |
… | …01100101111110101100 |
3 | 10122120112020101221210221 |
4 | 33000110021211332230 |
5 | 113343223313211340 |
6 | 2105410014541124 |
7 | 134332240113265 |
oct | 17002411457654 |
9 | 3576466357727 |
10 | 1031130210220 |
11 | 368333138660 |
12 | 147a0b5077a4 |
13 | 7630985b186 |
14 | 37c9aa1596c |
15 | 1bc4e6e244a |
hex | f014265fac |
1031130210220 has 48 divisors (see below), whose sum is σ = 2426069526048. Its totient is φ = 364822479360.
The previous prime is 1031130210217. The next prime is 1031130210251. The reversal of 1031130210220 is 220120311301.
It is a junction number, because it is equal to n+sod(n) for n = 1031130210194 and 1031130210203.
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, 63329097 + ... + 63345376.
It is an arithmetic number, because the mean of its divisors is an integer number (50543115126).
Almost surely, 21031130210220 is an apocalyptic number.
1031130210220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1031130210220 is an abundant number, since it is smaller than the sum of its proper divisors (1394939315828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1031130210220 is a wasteful number, since it uses less digits than its factorization.
1031130210220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126674530 (or 126674528 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 1031130210220 its reverse (220120311301), we get a palindrome (1251250521521).
The spelling of 1031130210220 in words is "one trillion, thirty-one billion, one hundred thirty million, two hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •