Base | Representation |
---|---|
bin | 10011100100010110… |
… | …101011101010010001 |
3 | 2000020021221102112222 |
4 | 103210112223222101 |
5 | 321012310123213 |
6 | 13352523030425 |
7 | 1342446504224 |
oct | 234426535221 |
9 | 60207842488 |
10 | 21011020433 |
11 | 8a0219a6a7 |
12 | 40a466b415 |
13 | 1c9aca2c90 |
14 | 10346a15bb |
15 | 82e8c7808 |
hex | 4e45aba91 |
21011020433 has 8 divisors (see below), whose sum is σ = 23179137576. Its totient is φ = 18921744000.
The previous prime is 21011020417. The next prime is 21011020451. The reversal of 21011020433 is 33402011012.
It can be written as a sum of positive squares in 4 ways, for example, as 860366224 + 20150654209 = 29332^2 + 141953^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 21011020433 - 24 = 21011020417 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21011020333) 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 7 ways as a sum of consecutive naturals, for example, 19709618 + ... + 19710683.
It is an arithmetic number, because the mean of its divisors is an integer number (2897392197).
Almost surely, 221011020433 is an apocalyptic number.
It is an amenable number.
21011020433 is a deficient number, since it is larger than the sum of its proper divisors (2168117143).
21011020433 is a wasteful number, since it uses less digits than its factorization.
21011020433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39420355.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 21011020433 its reverse (33402011012), we get a palindrome (54413031445).
The spelling of 21011020433 in words is "twenty-one billion, eleven million, twenty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •