Base | Representation |
---|---|
bin | 1001101100110101111101… |
… | …11101001100000001111001 |
3 | 2210112022122112201122022221 |
4 | 10312122332331030001321 |
5 | 10244000424343144113 |
6 | 113211442443044041 |
7 | 4331121061211344 |
oct | 466327675140171 |
9 | 83468575648287 |
10 | 21332011303033 |
11 | 688494528aa72 |
12 | 2486353510621 |
13 | bb97a53772b2 |
14 | 53a69100d45b |
15 | 26ed6427b98d |
hex | 1366bef4c079 |
21332011303033 has 8 divisors (see below), whose sum is σ = 21632593885056. Its totient is φ = 21031432380000.
The previous prime is 21332011303021. The next prime is 21332011303103. The reversal of 21332011303033 is 33030311023312.
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-21332011303033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21332011302989 and 21332011303007.
It is not an unprimeable number, because it can be changed into a prime (21332011304033) 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, 12128533 + ... + 13775533.
It is an arithmetic number, because the mean of its divisors is an integer number (2704074235632).
Almost surely, 221332011303033 is an apocalyptic number.
It is an amenable number.
21332011303033 is a deficient number, since it is larger than the sum of its proper divisors (300582582023).
21332011303033 is a wasteful number, since it uses less digits than its factorization.
21332011303033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1829495.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 21332011303033 its reverse (33030311023312), we get a palindrome (54362322326345).
The spelling of 21332011303033 in words is "twenty-one trillion, three hundred thirty-two billion, eleven million, three hundred three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •