Base | Representation |
---|---|
bin | 1001010001110011100011… |
… | …10100110101110010100101 |
3 | 2200020111201110012211001100 |
4 | 10220321301310311302211 |
5 | 10133240323102130341 |
6 | 111221002155350313 |
7 | 4204032316233606 |
oct | 450716164656245 |
9 | 80214643184040 |
10 | 20403004333221 |
11 | 655695804a454 |
12 | 23562a4a52399 |
13 | b4ccc2192a33 |
14 | 507721433dad |
15 | 255ae03cc3b6 |
hex | 128e71d35ca5 |
20403004333221 has 12 divisors (see below), whose sum is σ = 29471598895648. Its totient is φ = 13601729364264.
The previous prime is 20403004333181. The next prime is 20403004333249. The reversal of 20403004333221 is 12233340030402.
20403004333221 is a `hidden beast` number, since 2 + 0 + 4 + 0 + 3 + 0 + 0 + 433 + 3 + 221 = 666.
It is not a de Polignac number, because 20403004333221 - 214 = 20403004316837 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20403004333291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 22320775 + ... + 23216868.
Almost surely, 220403004333221 is an apocalyptic number.
It is an amenable number.
20403004333221 is a deficient number, since it is larger than the sum of its proper divisors (9068594562427).
20403004333221 is a wasteful number, since it uses less digits than its factorization.
20403004333221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45587432 (or 45587429 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 27.
Adding to 20403004333221 its reverse (12233340030402), we get a palindrome (32636344363623).
The spelling of 20403004333221 in words is "twenty trillion, four hundred three billion, four million, three hundred thirty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •