Base | Representation |
---|---|
bin | 1001101011111110101001… |
… | …01111011000000110010011 |
3 | 2210102110222202021020112202 |
4 | 10311333110233120012103 |
5 | 10243004113333311011 |
6 | 113150051432113415 |
7 | 4326020102325515 |
oct | 465772457300623 |
9 | 83373882236482 |
10 | 21302312010131 |
11 | 68732948636a9 |
12 | 248064523586b |
13 | bb6a51399ab9 |
14 | 5390748bdbb5 |
15 | 26e1c6c5123b |
hex | 135fd4bd8193 |
21302312010131 has 8 divisors (see below), whose sum is σ = 21436961470800. Its totient is φ = 21167710847712.
The previous prime is 21302312010121. The next prime is 21302312010181. The reversal of 21302312010131 is 13101021320312.
It is a happy number.
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 21302312010131 - 210 = 21302312009107 is a prime.
It is a super-2 number, since 2×213023120101312 (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 (21302312010121) 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, 11189456 + ... + 12954093.
It is an arithmetic number, because the mean of its divisors is an integer number (2679620183850).
Almost surely, 221302312010131 is an apocalyptic number.
21302312010131 is a deficient number, since it is larger than the sum of its proper divisors (134649460669).
21302312010131 is a wasteful number, since it uses less digits than its factorization.
21302312010131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24149125.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 21302312010131 its reverse (13101021320312), we get a palindrome (34403333330443).
The spelling of 21302312010131 in words is "twenty-one trillion, three hundred two billion, three hundred twelve million, ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •