Base | Representation |
---|---|
bin | 1001101100001111001101… |
… | …01001001011111101001101 |
3 | 2210110022221022221101000211 |
4 | 10312013212221023331031 |
5 | 10243130320242441023 |
6 | 113154121534122421 |
7 | 4326453313543135 |
oct | 466074651137515 |
9 | 83408838841024 |
10 | 21311202312013 |
11 | 687703713a029 |
12 | 2482306650411 |
13 | bb783a1bc263 |
14 | 5396794dbac5 |
15 | 26e5474aea0d |
hex | 1361e6a4bf4d |
21311202312013 has 8 divisors (see below), whose sum is σ = 21350381487680. Its totient is φ = 21272023936800.
The previous prime is 21311202311977. The next prime is 21311202312223. The reversal of 21311202312013 is 31021320211312.
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 21311202312013 - 241 = 19112179056461 is a prime.
It is a super-2 number, since 2×213112023120132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21311202316013) 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, 92109208 + ... + 92340286.
It is an arithmetic number, because the mean of its divisors is an integer number (2668797685960).
Almost surely, 221311202312013 is an apocalyptic number.
It is an amenable number.
21311202312013 is a deficient number, since it is larger than the sum of its proper divisors (39179175667).
21311202312013 is a wasteful number, since it uses less digits than its factorization.
21311202312013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400227.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 21311202312013 its reverse (31021320211312), we get a palindrome (52332522523325).
The spelling of 21311202312013 in words is "twenty-one trillion, three hundred eleven billion, two hundred two million, three hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •