Base | Representation |
---|---|
bin | 1001010010010110111110… |
… | …1111101000011100110101 |
3 | 1100011011101222120111221011 |
4 | 2110211233233220130311 |
5 | 2314244123034120041 |
6 | 33414512452552221 |
7 | 2102502253046041 |
oct | 224455757503465 |
9 | 40134358514834 |
10 | 10211012020021 |
11 | 32875140a290a |
12 | 118ab67322671 |
13 | 590b81a20177 |
14 | 27430392d021 |
15 | 12a92a02ce81 |
hex | 9496fbe8735 |
10211012020021 has 8 divisors (see below), whose sum is σ = 10221339655424. Its totient is φ = 10200688207920.
The previous prime is 10211012019917. The next prime is 10211012020057. The reversal of 10211012020021 is 12002021011201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10211012020021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10211012019983 and 10211012020010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10211012020081) 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, 4403515 + ... + 6309751.
It is an arithmetic number, because the mean of its divisors is an integer number (1277667456928).
Almost surely, 210211012020021 is an apocalyptic number.
It is an amenable number.
10211012020021 is a deficient number, since it is larger than the sum of its proper divisors (10327635403).
10211012020021 is a wasteful number, since it uses less digits than its factorization.
10211012020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1911651.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10211012020021 its reverse (12002021011201), we get a palindrome (22213033031222).
The spelling of 10211012020021 in words is "ten trillion, two hundred eleven billion, twelve million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •