Base | Representation |
---|---|
bin | 1001010010111100100110… |
… | …1001001000011011010101 |
3 | 1100012010110202002012200211 |
4 | 2110233021221020123111 |
5 | 2314430313202400041 |
6 | 33423302504005421 |
7 | 2103310432133050 |
oct | 224571151103325 |
9 | 40163422065624 |
10 | 10221110200021 |
11 | 3290826275a16 |
12 | 1190b05160871 |
13 | 591b00b648c6 |
14 | 2749c0b2ba97 |
15 | 12ad1b831481 |
hex | 94bc9a486d5 |
10221110200021 has 8 divisors (see below), whose sum is σ = 11697515354880. Its totient is φ = 8748766683888.
The previous prime is 10221110199941. The next prime is 10221110200031. The reversal of 10221110200021 is 12000201112201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10221110200021 - 225 = 10221076645589 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10221110199974 and 10221110200010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10221110200031) 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, 1015404286 + ... + 1015414351.
It is an arithmetic number, because the mean of its divisors is an integer number (1462189419360).
Almost surely, 210221110200021 is an apocalyptic number.
It is an amenable number.
10221110200021 is a deficient number, since it is larger than the sum of its proper divisors (1476405154859).
10221110200021 is an equidigital number, since it uses as much as digits as its factorization.
10221110200021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2030819363.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10221110200021 its reverse (12000201112201), we get a palindrome (22221311312222).
The spelling of 10221110200021 in words is "ten trillion, two hundred twenty-one billion, one hundred ten million, two hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.167 sec. • engine limits •