Base | Representation |
---|---|
bin | 1001010010010011100101… |
… | …1100110010010101101001 |
3 | 1100011002001111112111110110 |
4 | 2110210321130302111221 |
5 | 2314240241341010441 |
6 | 33414242233004533 |
7 | 2102440552331043 |
oct | 224447134622551 |
9 | 40132044474413 |
10 | 10210101110121 |
11 | 3287096999810 |
12 | 118a952253749 |
13 | 590a680a6a23 |
14 | 274258972a93 |
15 | 12a8c5098b16 |
hex | 94939732569 |
10210101110121 has 16 divisors (see below), whose sum is σ = 15029984551680. Its totient is φ = 6113386570320.
The previous prime is 10210101110051. The next prime is 10210101110123. The reversal of 10210101110121 is 12101110101201.
It is not a de Polignac number, because 10210101110121 - 210 = 10210101109097 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10210101110097 and 10210101110106.
It is not an unprimeable number, because it can be changed into a prime (10210101110123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1863834631 + ... + 1863840108.
It is an arithmetic number, because the mean of its divisors is an integer number (939374034480).
Almost surely, 210210101110121 is an apocalyptic number.
10210101110121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10210101110121 is a deficient number, since it is larger than the sum of its proper divisors (4819883441559).
10210101110121 is a wasteful number, since it uses less digits than its factorization.
10210101110121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3727674836.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 10210101110121 its reverse (12101110101201), we get a palindrome (22311211211322).
The spelling of 10210101110121 in words is "ten trillion, two hundred ten billion, one hundred one million, one hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.367 sec. • engine limits •