Base | Representation |
---|---|
bin | 1001010010011010101111… |
… | …1001110001101000001011 |
3 | 1100011021000022201212020222 |
4 | 2110212223321301220023 |
5 | 2314303204423441021 |
6 | 33415200545340255 |
7 | 2102536256640221 |
oct | 224465371615013 |
9 | 40137008655228 |
10 | 10212021312011 |
11 | 3287991892922 |
12 | 118b1a933768b |
13 | 590cb2b6186c |
14 | 27439b9b8b11 |
15 | 12a9889476ab |
hex | 949abe71a0b |
10212021312011 has 8 divisors (see below), whose sum is σ = 10289938831440. Its totient is φ = 10134289976832.
The previous prime is 10212021311957. The next prime is 10212021312047. The reversal of 10212021312011 is 11021312021201.
It is a happy number.
10212021312011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10212021312011 - 222 = 10212017117707 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10212021312061) 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, 46435946 + ... + 46655343.
It is an arithmetic number, because the mean of its divisors is an integer number (1286242353930).
Almost surely, 210212021312011 is an apocalyptic number.
10212021312011 is a deficient number, since it is larger than the sum of its proper divisors (77917519429).
10212021312011 is an equidigital number, since it uses as much as digits as its factorization.
10212021312011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 93092125.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 10212021312011 its reverse (11021312021201), we get a palindrome (21233333333212).
The spelling of 10212021312011 in words is "ten trillion, two hundred twelve billion, twenty-one million, three hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •