Base | Representation |
---|---|
bin | 1001100011110001011000… |
… | …10011010010100111101101 |
3 | 2202102112002202202110120111 |
4 | 10301320230103102213231 |
5 | 10223344100134414013 |
6 | 112412333143020021 |
7 | 4266444646105441 |
oct | 461705423224755 |
9 | 82375082673514 |
10 | 21020313201133 |
11 | 6774734892664 |
12 | 2435a6443a611 |
13 | b9628cac78cc |
14 | 5295623d8821 |
15 | 266bbead373d |
hex | 131e2c4d29ed |
21020313201133 has 8 divisors (see below), whose sum is σ = 21102556194720. Its totient is φ = 20938100582640.
The previous prime is 21020313201113. The next prime is 21020313201149. The reversal of 21020313201133 is 33110231302012.
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 21020313201133 - 217 = 21020313070061 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21020313201113) 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 7 ways as a sum of consecutive naturals, for example, 6206523 + ... + 8975608.
It is an arithmetic number, because the mean of its divisors is an integer number (2637819524340).
Almost surely, 221020313201133 is an apocalyptic number.
It is an amenable number.
21020313201133 is a deficient number, since it is larger than the sum of its proper divisors (82242993587).
21020313201133 is a wasteful number, since it uses less digits than its factorization.
21020313201133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15187547.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 21020313201133 its reverse (33110231302012), we get a palindrome (54130544503145).
The spelling of 21020313201133 in words is "twenty-one trillion, twenty billion, three hundred thirteen million, two hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •