Base | Representation |
---|---|
bin | 1001010010010111010011… |
… | …1111010010101000000101 |
3 | 1100011011122010010220212210 |
4 | 2110211310333102220011 |
5 | 2314244313100323023 |
6 | 33414525314534033 |
7 | 2102504402003406 |
oct | 224456477225005 |
9 | 40134563126783 |
10 | 10211100011013 |
11 | 3287559831840 |
12 | 118ab90897319 |
13 | 590b9701a845 |
14 | 2743114b59ad |
15 | 12a932b0e593 |
hex | 94974fd2a05 |
10211100011013 has 16 divisors (see below), whose sum is σ = 14852661443136. Its totient is φ = 6188481987840.
The previous prime is 10211100010997. The next prime is 10211100011029. The reversal of 10211100011013 is 31011000111201.
It is an interprime number because it is at equal distance from previous prime (10211100010997) and next prime (10211100011029).
It is not a de Polignac number, because 10211100011013 - 24 = 10211100010997 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10211100011013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10211100011083) 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, 1786381 + ... + 4859357.
It is an arithmetic number, because the mean of its divisors is an integer number (928291340196).
Almost surely, 210211100011013 is an apocalyptic number.
It is an amenable number.
10211100011013 is a deficient number, since it is larger than the sum of its proper divisors (4641561432123).
10211100011013 is a wasteful number, since it uses less digits than its factorization.
10211100011013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3173684.
The product of its (nonzero) digits is 6, while the sum is 12.
Adding to 10211100011013 its reverse (31011000111201), we get a palindrome (41222100122214).
The spelling of 10211100011013 in words is "ten trillion, two hundred eleven billion, one hundred million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •