Base | Representation |
---|---|
bin | 10011110111011111… |
… | …111110100110110001 |
3 | 2001001200100021121102 |
4 | 103313133332212301 |
5 | 322142022140213 |
6 | 13444435334145 |
7 | 1353426626102 |
oct | 236737764661 |
9 | 61050307542 |
10 | 21332224433 |
11 | 9057536a53 |
12 | 4174151355 |
13 | 201c6b6210 |
14 | 10651d43a9 |
15 | 84cbc4158 |
hex | 4f77fe9b1 |
21332224433 has 8 divisors (see below), whose sum is σ = 22975982568. Its totient is φ = 19688868864.
The previous prime is 21332224423. The next prime is 21332224447. The reversal of 21332224433 is 33442223312.
It can be written as a sum of positive squares in 4 ways, for example, as 12947708944 + 8384515489 = 113788^2 + 91567^2 .
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-21332224433 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21332224396 and 21332224405.
It is not an unprimeable number, because it can be changed into a prime (21332224423) 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, 14291 + ... + 207047.
It is an arithmetic number, because the mean of its divisors is an integer number (2871997821).
Almost surely, 221332224433 is an apocalyptic number.
It is an amenable number.
21332224433 is a deficient number, since it is larger than the sum of its proper divisors (1643758135).
21332224433 is a wasteful number, since it uses less digits than its factorization.
21332224433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 201283.
The product of its digits is 20736, while the sum is 29.
Adding to 21332224433 its reverse (33442223312), we get a palindrome (54774447745).
The spelling of 21332224433 in words is "twenty-one billion, three hundred thirty-two million, two hundred twenty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •