Base | Representation |
---|---|
bin | 1001101001111011111001… |
… | …11110100010000011010111 |
3 | 2210011202210221211022222202 |
4 | 10310331330332202003113 |
5 | 10240331340222030234 |
6 | 113053522404115115 |
7 | 4320653505122225 |
oct | 464757476420327 |
9 | 83152727738882 |
10 | 21232120111319 |
11 | 6846545312177 |
12 | 246ab16095a9b |
13 | bb0246273670 |
14 | 5358d65d3b15 |
15 | 26c46988677e |
hex | 134f7cfa20d7 |
21232120111319 has 8 divisors (see below), whose sum is σ = 22916285204400. Its totient is φ = 19555230030336.
The previous prime is 21232120111313. The next prime is 21232120111327. The reversal of 21232120111319 is 91311102123212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21232120111319 - 220 = 21232119062743 is a prime.
It is a super-2 number, since 2×212321201113192 (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 = 21232120111291 and 21232120111300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21232120111313) 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, 1818746957 + ... + 1818758630.
It is an arithmetic number, because the mean of its divisors is an integer number (2864535650550).
Almost surely, 221232120111319 is an apocalyptic number.
21232120111319 is a deficient number, since it is larger than the sum of its proper divisors (1684165093081).
21232120111319 is a wasteful number, since it uses less digits than its factorization.
21232120111319 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3637506049.
The product of its (nonzero) digits is 1296, while the sum is 29.
The spelling of 21232120111319 in words is "twenty-one trillion, two hundred thirty-two billion, one hundred twenty million, one hundred eleven thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •