Base | Representation |
---|---|
bin | 1001101011111100001110… |
… | …10100111110010011111011 |
3 | 2210102100122020102001011021 |
4 | 10311332013110332103323 |
5 | 10242443433342240011 |
6 | 113145314515043311 |
7 | 4325642652102016 |
oct | 465760724762373 |
9 | 83370566361137 |
10 | 21301013243131 |
11 | 6872788728846 |
12 | 24803422a0537 |
13 | bb68a52a410b |
14 | 538d9020037d |
15 | 26e14cc06471 |
hex | 135f8753e4fb |
21301013243131 has 16 divisors (see below), whose sum is σ = 22365694713600. Its totient is φ = 20258377701408.
The previous prime is 21301013243123. The next prime is 21301013243137. The reversal of 21301013243131 is 13134231010312.
It is a cyclic number.
It is not a de Polignac number, because 21301013243131 - 23 = 21301013243123 is a prime.
It is a super-2 number, since 2×213010132431312 (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 = 21301013243096 and 21301013243105.
It is not an unprimeable number, because it can be changed into a prime (21301013243137) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 34785106 + ... + 35392168.
It is an arithmetic number, because the mean of its divisors is an integer number (1397855919600).
Almost surely, 221301013243131 is an apocalyptic number.
21301013243131 is a deficient number, since it is larger than the sum of its proper divisors (1064681470469).
21301013243131 is a wasteful number, since it uses less digits than its factorization.
21301013243131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 625218.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 21301013243131 its reverse (13134231010312), we get a palindrome (34435244253443).
The spelling of 21301013243131 in words is "twenty-one trillion, three hundred one billion, thirteen million, two hundred forty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •