Base | Representation |
---|---|
bin | 1001100011110001000011… |
… | …00100000000010101110011 |
3 | 2202102111122012201222210221 |
4 | 10301320201210000111303 |
5 | 10223343213024031311 |
6 | 112412303225233511 |
7 | 4266440330521045 |
oct | 461704144002563 |
9 | 82374565658727 |
10 | 21020133033331 |
11 | 6774652115953 |
12 | 2435a14032897 |
13 | b96261695543 |
14 | 5295464d9a95 |
15 | 266badd95671 |
hex | 131e21900573 |
21020133033331 has 16 divisors (see below), whose sum is σ = 21293312140800. Its totient is φ = 20748387055968.
The previous prime is 21020133033283. The next prime is 21020133033377. The reversal of 21020133033331 is 13333033102012.
It is a cyclic number.
It is not a de Polignac number, because 21020133033331 - 211 = 21020133031283 is a prime.
It is a super-2 number, since 2×210201330333312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21020133033296 and 21020133033305.
It is not an unprimeable number, because it can be changed into a prime (21020133033391) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 525627885 + ... + 525667873.
It is an arithmetic number, because the mean of its divisors is an integer number (1330832008800).
Almost surely, 221020133033331 is an apocalyptic number.
21020133033331 is a deficient number, since it is larger than the sum of its proper divisors (273179107469).
21020133033331 is a wasteful number, since it uses less digits than its factorization.
21020133033331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57738.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 21020133033331 its reverse (13333033102012), we get a palindrome (34353166135343).
The spelling of 21020133033331 in words is "twenty-one trillion, twenty billion, one hundred thirty-three million, thirty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •