Base | Representation |
---|---|
bin | 1001101100100000001011… |
… | …01100100101111011011001 |
3 | 2210111012110021202010012001 |
4 | 10312100011230211323121 |
5 | 10243303000141424423 |
6 | 113202230000521001 |
7 | 4330225144233256 |
oct | 466200554457331 |
9 | 83435407663161 |
10 | 21320313233113 |
11 | 687a992000994 |
12 | 2484029920161 |
13 | bb865c937c2b |
14 | 539ca154842d |
15 | 26e8cc29bcad |
hex | 136405b25ed9 |
21320313233113 has 4 divisors (see below), whose sum is σ = 21320402203408. Its totient is φ = 21320224262820.
The previous prime is 21320313233111. The next prime is 21320313233171. The reversal of 21320313233113 is 31133231302312.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 21320313233113 - 21 = 21320313233111 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21320313233111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 44124723 + ... + 44605288.
It is an arithmetic number, because the mean of its divisors is an integer number (5330100550852).
Almost surely, 221320313233113 is an apocalyptic number.
It is an amenable number.
21320313233113 is a deficient number, since it is larger than the sum of its proper divisors (88970295).
21320313233113 is an equidigital number, since it uses as much as digits as its factorization.
21320313233113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 88970294.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 21320313233113 its reverse (31133231302312), we get a palindrome (52453544535425).
The spelling of 21320313233113 in words is "twenty-one trillion, three hundred twenty billion, three hundred thirteen million, two hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •