Base | Representation |
---|---|
bin | 1001000110110010010111… |
… | …0000011001011011001101 |
3 | 1022110011020120211210112220 |
4 | 2101230211300121123031 |
5 | 2303014442231223041 |
6 | 33143313040445553 |
7 | 2052233463414453 |
oct | 221544560313315 |
9 | 38404216753486 |
10 | 10012202211021 |
11 | 321017314883a |
12 | 11585223198b9 |
13 | 5781ba16c82a |
14 | 2688439469d3 |
15 | 125691307d66 |
hex | 91b25c196cd |
10012202211021 has 16 divisors (see below), whose sum is σ = 13386348480384. Its totient is φ = 6656431264704.
The previous prime is 10012202211019. The next prime is 10012202211023. The reversal of 10012202211021 is 12011220221001.
It is an interprime number because it is at equal distance from previous prime (10012202211019) and next prime (10012202211023).
It is not a de Polignac number, because 10012202211021 - 21 = 10012202211019 is a prime.
It is a super-2 number, since 2×100122022110212 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10012202211023) 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, 15719655 + ... + 16344171.
It is an arithmetic number, because the mean of its divisors is an integer number (836646780024).
Almost surely, 210012202211021 is an apocalyptic number.
It is an amenable number.
10012202211021 is a deficient number, since it is larger than the sum of its proper divisors (3374146269363).
10012202211021 is a wasteful number, since it uses less digits than its factorization.
10012202211021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 639220.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10012202211021 its reverse (12011220221001), we get a palindrome (22023422432022).
The spelling of 10012202211021 in words is "ten trillion, twelve billion, two hundred two million, two hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •