Base | Representation |
---|---|
bin | 10011110000111111… |
… | …011001011000000001 |
3 | 2000210001212010100000 |
4 | 103300333121120001 |
5 | 321431043120113 |
6 | 13425534550213 |
7 | 1350632456655 |
oct | 236077313001 |
9 | 60701763300 |
10 | 21223020033 |
11 | 9000929086 |
12 | 4143668369 |
13 | 2002b9c027 |
14 | 10548c8a65 |
15 | 843302373 |
hex | 4f0fd9601 |
21223020033 has 48 divisors (see below), whose sum is σ = 33027321600. Its totient is φ = 13602556800.
The previous prime is 21223020001. The next prime is 21223020041. The reversal of 21223020033 is 33002032212.
It is a happy number.
It is not a de Polignac number, because 21223020033 - 25 = 21223020001 is a prime.
It is a super-2 number, since 2×212230200332 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 21223019988 and 21223020015.
It is not an unprimeable number, because it can be changed into a prime (21223020233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1677933 + ... + 1690533.
It is an arithmetic number, because the mean of its divisors is an integer number (688069200).
Almost surely, 221223020033 is an apocalyptic number.
It is an amenable number.
21223020033 is a deficient number, since it is larger than the sum of its proper divisors (11804301567).
21223020033 is a wasteful number, since it uses less digits than its factorization.
21223020033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12884 (or 12872 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 21223020033 its reverse (33002032212), we get a palindrome (54225052245).
The spelling of 21223020033 in words is "twenty-one billion, two hundred twenty-three million, twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •