Base | Representation |
---|---|
bin | 1001101100010010110011… |
… | …01010011100000110100011 |
3 | 2210110111220211000200220212 |
4 | 10312021121222130012203 |
5 | 10243143243244121011 |
6 | 113155041230324335 |
7 | 4326552165024260 |
oct | 466113152340643 |
9 | 83414824020825 |
10 | 21313132020131 |
11 | 6877937436326 |
12 | 24827649596ab |
13 | bb7a86c24c93 |
14 | 5397bd8da267 |
15 | 26e60bada08b |
hex | 136259a9c1a3 |
21313132020131 has 16 divisors (see below), whose sum is σ = 25792836917760. Its totient is φ = 17192349740160.
The previous prime is 21313132020121. The next prime is 21313132020133. The reversal of 21313132020131 is 13102023131312.
It is not a de Polignac number, because 21313132020131 - 214 = 21313132003747 is a prime.
It is a super-2 number, since 2×213131320201312 (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 = 21313132020097 and 21313132020106.
It is not an unprimeable number, because it can be changed into a prime (21313132020133) 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, 6056111 + ... + 8905208.
It is an arithmetic number, because the mean of its divisors is an integer number (1612052307360).
Almost surely, 221313132020131 is an apocalyptic number.
21313132020131 is a deficient number, since it is larger than the sum of its proper divisors (4479704897629).
21313132020131 is a wasteful number, since it uses less digits than its factorization.
21313132020131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14973314.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 21313132020131 its reverse (13102023131312), we get a palindrome (34415155151443).
The spelling of 21313132020131 in words is "twenty-one trillion, three hundred thirteen billion, one hundred thirty-two million, twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •