Base | Representation |
---|---|
bin | 1001101110110111000100… |
… | …00110000010011011100111 |
3 | 2210202221112210211121102012 |
4 | 10313123202012002123213 |
5 | 10301114400444133221 |
6 | 113303344131304435 |
7 | 4336123445040545 |
oct | 467334206023347 |
9 | 83687483747365 |
10 | 21401320302311 |
11 | 6901281419a64 |
12 | 2497876a4b11b |
13 | bc319c5b3781 |
14 | 53db87d50d95 |
15 | 271a6dd9665b |
hex | 1376e21826e7 |
21401320302311 has 32 divisors (see below), whose sum is σ = 23589739438080. Its totient is φ = 19325336659200.
The previous prime is 21401320302283. The next prime is 21401320302331. The reversal of 21401320302311 is 11320302310412.
It is a cyclic number.
It is not a de Polignac number, because 21401320302311 - 26 = 21401320302247 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21401320302331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 463801301 + ... + 463847441.
It is an arithmetic number, because the mean of its divisors is an integer number (737179357440).
Almost surely, 221401320302311 is an apocalyptic number.
21401320302311 is a deficient number, since it is larger than the sum of its proper divisors (2188419135769).
21401320302311 is a wasteful number, since it uses less digits than its factorization.
21401320302311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49887.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 21401320302311 its reverse (11320302310412), we get a palindrome (32721622612723).
The spelling of 21401320302311 in words is "twenty-one trillion, four hundred one billion, three hundred twenty million, three hundred two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •