Base | Representation |
---|---|
bin | 1001000110110101110100… |
… | …0111110111011101001100 |
3 | 1022110020122022201202200221 |
4 | 2101231131013313131030 |
5 | 2303023343031011340 |
6 | 33143545142201124 |
7 | 2052265503055420 |
oct | 221553507673514 |
9 | 38406568652627 |
10 | 10013131110220 |
11 | 32105aa519527 |
12 | 11587414231a4 |
13 | 578307744124 |
14 | 2688d1066b80 |
15 | 1256e7b4244a |
hex | 91b5d1f774c |
10013131110220 has 24 divisors (see below), whose sum is σ = 24031514664864. Its totient is φ = 3433073523456.
The previous prime is 10013131110211. The next prime is 10013131110247. The reversal of 10013131110220 is 2201113131001.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 10013131110194 and 10013131110203.
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, 35761182397 + ... + 35761182676.
It is an arithmetic number, because the mean of its divisors is an integer number (1001313111036).
Almost surely, 210013131110220 is an apocalyptic number.
10013131110220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10013131110220 is an abundant number, since it is smaller than the sum of its proper divisors (14018383554644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10013131110220 is a wasteful number, since it uses less digits than its factorization.
10013131110220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71522365089 (or 71522365087 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 10013131110220 its reverse (2201113131001), we get a palindrome (12214244241221).
The spelling of 10013131110220 in words is "ten trillion, thirteen billion, one hundred thirty-one million, one hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •