Base | Representation |
---|---|
bin | 1001010010011011000111… |
… | …0010010001110101111111 |
3 | 1100011021021012110020121011 |
4 | 2110212301302101311333 |
5 | 2314303410210310421 |
6 | 33415214433020051 |
7 | 2102541565600615 |
oct | 224466162216577 |
9 | 40137235406534 |
10 | 10212120010111 |
11 | 3287a325751a8 |
12 | 118b2163b4627 |
13 | 590cca43a8c6 |
14 | 2743aab4b6b5 |
15 | 12a9924414e1 |
hex | 949b1c91d7f |
10212120010111 has 4 divisors (see below), whose sum is σ = 10290075124824. Its totient is φ = 10134164895400.
The previous prime is 10212120010069. The next prime is 10212120010121. The reversal of 10212120010111 is 11101002121201.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10212120010111 - 29 = 10212120009599 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10212120010091 and 10212120010100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10212120010121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38977557160 + ... + 38977557421.
It is an arithmetic number, because the mean of its divisors is an integer number (2572518781206).
Almost surely, 210212120010111 is an apocalyptic number.
10212120010111 is a deficient number, since it is larger than the sum of its proper divisors (77955114713).
10212120010111 is an equidigital number, since it uses as much as digits as its factorization.
10212120010111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 77955114712.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10212120010111 its reverse (11101002121201), we get a palindrome (21313122131312).
The spelling of 10212120010111 in words is "ten trillion, two hundred twelve billion, one hundred twenty million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •