Base | Representation |
---|---|
bin | 1001100011010001101101… |
… | …11001111011100100101001 |
3 | 2202100220012212120000022221 |
4 | 10301220312321323210221 |
5 | 10223104240133431241 |
6 | 112400442111514041 |
7 | 4265303426550244 |
oct | 461506671734451 |
9 | 82326185500287 |
10 | 21003311233321 |
11 | 67684aa6aa59a |
12 | 24326ba528921 |
13 | b947b0595921 |
14 | 5287cc36625b |
15 | 26652716d5d1 |
hex | 131a36e7b929 |
21003311233321 has 8 divisors (see below), whose sum is σ = 21916766450304. Its totient is φ = 20089878330720.
The previous prime is 21003311233319. The next prime is 21003311233349. The reversal of 21003311233321 is 12333211330012.
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 21003311233321 - 21 = 21003311233319 is a prime.
It is a super-2 number, since 2×210033112333212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21003311236321) 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, 3640845 + ... + 7433866.
It is an arithmetic number, because the mean of its divisors is an integer number (2739595806288).
Almost surely, 221003311233321 is an apocalyptic number.
It is an amenable number.
21003311233321 is a deficient number, since it is larger than the sum of its proper divisors (913455216983).
21003311233321 is a wasteful number, since it uses less digits than its factorization.
21003311233321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11157191.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 21003311233321 its reverse (12333211330012), we get a palindrome (33336522563333).
The spelling of 21003311233321 in words is "twenty-one trillion, three billion, three hundred eleven million, two hundred thirty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •