Base | Representation |
---|---|
bin | 1001010010010011101100… |
… | …1011000100011100001111 |
3 | 1100011002010111221021111211 |
4 | 2110210323023010130033 |
5 | 2314240321241120421 |
6 | 33414245144355251 |
7 | 2102441353136530 |
oct | 224447313043417 |
9 | 40132114837454 |
10 | 10210130020111 |
11 | 328710124526a |
12 | 118a95ba75b27 |
13 | 590a71089828 |
14 | 27425c73a687 |
15 | 12a8c78a99e1 |
hex | 9493b2c470f |
10210130020111 has 8 divisors (see below), whose sum is σ = 11984090834720. Its totient is φ = 8515011908448.
The previous prime is 10210130020093. The next prime is 10210130020157. The reversal of 10210130020111 is 11102003101201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10210130020111 - 221 = 10210127922959 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10210130020091 and 10210130020100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10210130020711) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19710675456 + ... + 19710675973.
It is an arithmetic number, because the mean of its divisors is an integer number (1498011354340).
Almost surely, 210210130020111 is an apocalyptic number.
10210130020111 is a deficient number, since it is larger than the sum of its proper divisors (1773960814609).
10210130020111 is an equidigital number, since it uses as much as digits as its factorization.
10210130020111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39421351473.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 10210130020111 its reverse (11102003101201), we get a palindrome (21312133121312).
The spelling of 10210130020111 in words is "ten trillion, two hundred ten billion, one hundred thirty million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •