Base | Representation |
---|---|
bin | 1001000110101010100010… |
… | …0000111010111111100010 |
3 | 1022102221211011001022221100 |
4 | 2101222220200322333202 |
5 | 2303001141324032320 |
6 | 33142324340335230 |
7 | 2052130430424321 |
oct | 221525040727742 |
9 | 38387734038840 |
10 | 10010101002210 |
11 | 320a295064531 |
12 | 11580366a4516 |
13 | 577c43a4a6ca |
14 | 2686c48640b8 |
15 | 1255bbb02790 |
hex | 91aa883afe2 |
10010101002210 has 48 divisors (see below), whose sum is σ = 26729675117496. Its totient is φ = 2597215394304.
The previous prime is 10010101002203. The next prime is 10010101002259. The reversal of 10010101002210 is 1220010101001.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 7752543666921 + 2257557335289 = 2784339^2 + 1502517^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 10010101002192 and 10010101002201.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1503014839 + ... + 1503021498.
Almost surely, 210010101002210 is an apocalyptic number.
10010101002210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10010101002210 is an abundant number, since it is smaller than the sum of its proper divisors (16719574115286).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10010101002210 is a wasteful number, since it uses less digits than its factorization.
10010101002210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3006036387 (or 3006036384 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10010101002210 its reverse (1220010101001), we get a palindrome (11230111103211).
The spelling of 10010101002210 in words is "ten trillion, ten billion, one hundred one million, two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •