Base | Representation |
---|---|
bin | 1001101001101011000110… |
… | …10110011000001010000001 |
3 | 2210010220112100022101021010 |
4 | 10310311203112120022001 |
5 | 10240204402124020113 |
6 | 113045431352351133 |
7 | 4320214131244125 |
oct | 464654326301201 |
9 | 83126470271233 |
10 | 21223100220033 |
11 | 6842736875368 |
12 | 24692193a54a9 |
13 | bac43964a59a |
14 | 5352bc6c1585 |
15 | 26c0dca7b1c3 |
hex | 134d63598281 |
21223100220033 has 16 divisors (see below), whose sum is σ = 28828058628096. Its totient is φ = 13885695483600.
The previous prime is 21223100219947. The next prime is 21223100220037. The reversal of 21223100220033 is 33002200132212.
It is a happy number.
It is not a de Polignac number, because 21223100220033 - 29 = 21223100219521 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21223100219991 and 21223100220009.
It is not an unprimeable number, because it can be changed into a prime (21223100220037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 282191985 + ... + 282267182.
It is an arithmetic number, because the mean of its divisors is an integer number (1801753664256).
Almost surely, 221223100220033 is an apocalyptic number.
It is an amenable number.
21223100220033 is a deficient number, since it is larger than the sum of its proper divisors (7604958408063).
21223100220033 is a wasteful number, since it uses less digits than its factorization.
21223100220033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 564459404.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 21223100220033 its reverse (33002200132212), we get a palindrome (54225300352245).
The spelling of 21223100220033 in words is "twenty-one trillion, two hundred twenty-three billion, one hundred million, two hundred twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •