Base | Representation |
---|---|
bin | 1001101011111100011100… |
… | …10110100100001110111001 |
3 | 2210102100221110011211220201 |
4 | 10311332032112210032321 |
5 | 10242444204030213423 |
6 | 113145334325122201 |
7 | 4325645612632213 |
oct | 465761626441671 |
9 | 83370843154821 |
10 | 21301131101113 |
11 | 6872839207236 |
12 | 2480375859361 |
13 | bb68c382b076 |
14 | 538da1b1d5b3 |
15 | 26e1582372ad |
hex | 135f8e5a43b9 |
21301131101113 has 8 divisors (see below), whose sum is σ = 22227681528000. Its totient is φ = 20374615198608.
The previous prime is 21301131101057. The next prime is 21301131101269. The reversal of 21301131101113 is 31110113110312.
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 21301131101113 - 221 = 21301129003961 is a prime.
It is not an unprimeable number, because it can be changed into a prime (21301131101713) 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, 7366338 + ... + 9842011.
It is an arithmetic number, because the mean of its divisors is an integer number (2778460191000).
Almost surely, 221301131101113 is an apocalyptic number.
21301131101113 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
21301131101113 is a deficient number, since it is larger than the sum of its proper divisors (926550426887).
21301131101113 is a wasteful number, since it uses less digits than its factorization.
21301131101113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17262191.
The product of its (nonzero) digits is 54, while the sum is 19.
Adding to 21301131101113 its reverse (31110113110312), we get a palindrome (52411244211425).
The spelling of 21301131101113 in words is "twenty-one trillion, three hundred one billion, one hundred thirty-one million, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •