Base | Representation |
---|---|
bin | 10010101001010011… |
… | …00010100100001100 |
3 | 221211121210021201222 |
4 | 21110221202210030 |
5 | 131000042011340 |
6 | 4333143222512 |
7 | 503026350545 |
oct | 112451424414 |
9 | 27747707658 |
10 | 10010110220 |
11 | 427749aa70 |
12 | 1b34447a38 |
13 | c36b1a256 |
14 | 6ad6354cc |
15 | 3d8c088b5 |
hex | 254a6290c |
10010110220 has 24 divisors (see below), whose sum is σ = 22932253008. Its totient is φ = 3640040000.
The previous prime is 10010110219. The next prime is 10010110237. The reversal of 10010110220 is 2201101001.
It is a super-3 number, since 3×100101102203 (a number of 31 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10010110198 and 10010110207.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22750031 + ... + 22750470.
It is an arithmetic number, because the mean of its divisors is an integer number (955510542).
Almost surely, 210010110220 is an apocalyptic number.
10010110220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10010110220 is an abundant number, since it is smaller than the sum of its proper divisors (12922142788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10010110220 is a wasteful number, since it uses less digits than its factorization.
10010110220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45500521 (or 45500519 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 10010110220 its reverse (2201101001), we get a palindrome (12211211221).
The spelling of 10010110220 in words is "ten billion, ten million, one hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •