Base | Representation |
---|---|
bin | 1001010010011010101111… |
… | …1101001101010110101101 |
3 | 1100011021000101102120211101 |
4 | 2110212223331031112231 |
5 | 2314303210141241023 |
6 | 33415201020523101 |
7 | 2102536300406146 |
oct | 224465375152655 |
9 | 40137011376741 |
10 | 10212022212013 |
11 | 3287992348026 |
12 | 118b1a96b0491 |
13 | 590cb30b83cb |
14 | 27439bb70acd |
15 | 12a988a741ad |
hex | 949abf4d5ad |
10212022212013 has 4 divisors (see below), whose sum is σ = 10244858296608. Its totient is φ = 10179186127420.
The previous prime is 10212022212011. The next prime is 10212022212047. The reversal of 10212022212013 is 31021222021201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10212022212013 - 21 = 10212022212011 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10212022212011) 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, 16418041831 + ... + 16418042452.
It is an arithmetic number, because the mean of its divisors is an integer number (2561214574152).
Almost surely, 210212022212013 is an apocalyptic number.
It is an amenable number.
10212022212013 is a deficient number, since it is larger than the sum of its proper divisors (32836084595).
10212022212013 is an equidigital number, since it uses as much as digits as its factorization.
10212022212013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32836084594.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 10212022212013 its reverse (31021222021201), we get a palindrome (41233244233214).
The spelling of 10212022212013 in words is "ten trillion, two hundred twelve billion, twenty-two million, two hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •