Base | Representation |
---|---|
bin | 1001010010010111000001… |
… | …0001111001010101111111 |
3 | 1100011011102121110212001011 |
4 | 2110211300101321111333 |
5 | 2314244132334031421 |
6 | 33414513413300051 |
7 | 2102502422305636 |
oct | 224456021712577 |
9 | 40134377425034 |
10 | 10211021002111 |
11 | 3287519178226 |
12 | 118ab6a334627 |
13 | 590b83846607 |
14 | 274304bca51d |
15 | 12a92ac044e1 |
hex | 9497047957f |
10211021002111 has 16 divisors (see below), whose sum is σ = 10293259082400. Its totient is φ = 10128912288768.
The previous prime is 10211021002103. The next prime is 10211021002157. The reversal of 10211021002111 is 11120012011201.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 10211021002111 - 23 = 10211021002103 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10211021002091 and 10211021002100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10211021003111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1613367195 + ... + 1613373523.
It is an arithmetic number, because the mean of its divisors is an integer number (643328692650).
Almost surely, 210211021002111 is an apocalyptic number.
10211021002111 is a deficient number, since it is larger than the sum of its proper divisors (82238080289).
10211021002111 is a wasteful number, since it uses less digits than its factorization.
10211021002111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14538.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10211021002111 its reverse (11120012011201), we get a palindrome (21331033013312).
The spelling of 10211021002111 in words is "ten trillion, two hundred eleven billion, twenty-one million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •