Base | Representation |
---|---|
bin | 1001100011110001000011… |
… | …00011111011011101010011 |
3 | 2202102111122012200222101012 |
4 | 10301320201203323131103 |
5 | 10223343213022411311 |
6 | 112412303225001135 |
7 | 4266440330405534 |
oct | 461704143733523 |
9 | 82374565628335 |
10 | 21020133013331 |
11 | 6774652101921 |
12 | 2435a140231ab |
13 | b962616893ca |
14 | 5295464d268b |
15 | 266badd8e78b |
hex | 131e218fb753 |
21020133013331 has 16 divisors (see below), whose sum is σ = 21717416966400. Its totient is φ = 20329737797088.
The previous prime is 21020133013291. The next prime is 21020133013339. The reversal of 21020133013331 is 13331033102012.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21020133013331 is a prime.
It is a super-2 number, since 2×210201330133312 (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 = 21020133013297 and 21020133013306.
It is not an unprimeable number, because it can be changed into a prime (21020133013339) 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, 16190786 + ... + 17440808.
It is an arithmetic number, because the mean of its divisors is an integer number (1357338560400).
Almost surely, 221020133013331 is an apocalyptic number.
21020133013331 is a deficient number, since it is larger than the sum of its proper divisors (697283953069).
21020133013331 is a wasteful number, since it uses less digits than its factorization.
21020133013331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1252778.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 21020133013331 its reverse (13331033102012), we get a palindrome (34351166115343).
The spelling of 21020133013331 in words is "twenty-one trillion, twenty billion, one hundred thirty-three million, thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •