Base | Representation |
---|---|
bin | 1001101001100101100010… |
… | …10000000010000011100001 |
3 | 2210010121211002211212002002 |
4 | 10310302301100002003201 |
5 | 10240132242211242233 |
6 | 113044215053133345 |
7 | 4320050106506036 |
oct | 464626120020341 |
9 | 83117732755062 |
10 | 21220112212193 |
11 | 68414431558a4 |
12 | 246872478a255 |
13 | bac0815a45cb |
14 | 5350b791b38d |
15 | 26beb55a56e8 |
hex | 134cb14020e1 |
21220112212193 has 8 divisors (see below), whose sum is σ = 21951891556200. Its totient is φ = 20488336290688.
The previous prime is 21220112212177. The next prime is 21220112212207. The reversal of 21220112212193 is 39121221102212.
It can be written as a sum of positive squares in 4 ways, for example, as 9145404594769 + 12074707617424 = 3024137^2 + 3474868^2 .
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 21220112212193 - 24 = 21220112212177 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is not an unprimeable number, because it can be changed into a prime (21220112212133) 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, 23839223 + ... + 24713331.
It is an arithmetic number, because the mean of its divisors is an integer number (2743986444525).
Almost surely, 221220112212193 is an apocalyptic number.
It is an amenable number.
21220112212193 is a deficient number, since it is larger than the sum of its proper divisors (731779344007).
21220112212193 is an equidigital number, since it uses as much as digits as its factorization.
21220112212193 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1711251.
The product of its (nonzero) digits is 1728, while the sum is 29.
The spelling of 21220112212193 in words is "twenty-one trillion, two hundred twenty billion, one hundred twelve million, two hundred twelve thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •