Base | Representation |
---|---|
bin | 1001101011111100010010… |
… | …00000011011001111010111 |
3 | 2210102100201012102010020211 |
4 | 10311332021000123033113 |
5 | 10242444013100123111 |
6 | 113145321402510251 |
7 | 4325643443400124 |
oct | 465761100331727 |
9 | 83370635363224 |
10 | 21301041411031 |
11 | 68727a26177a8 |
12 | 248034b805387 |
13 | bb68ab087205 |
14 | 538d93c5374b |
15 | 26e15041c521 |
hex | 135f8901b3d7 |
21301041411031 has 32 divisors (see below), whose sum is σ = 23447969838720. Its totient is φ = 19268424806400.
The previous prime is 21301041411029. The next prime is 21301041411043. The reversal of 21301041411031 is 13011414010312.
It is a cyclic number.
It is not a de Polignac number, because 21301041411031 - 21 = 21301041411029 is a prime.
It is a super-2 number, since 2×213010414110312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21301041410993 and 21301041411011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21301041411071) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 63026365 + ... + 63363433.
It is an arithmetic number, because the mean of its divisors is an integer number (732749057460).
Almost surely, 221301041411031 is an apocalyptic number.
21301041411031 is a deficient number, since it is larger than the sum of its proper divisors (2146928427689).
21301041411031 is a wasteful number, since it uses less digits than its factorization.
21301041411031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 338475.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 21301041411031 its reverse (13011414010312), we get a palindrome (34312455421343).
The spelling of 21301041411031 in words is "twenty-one trillion, three hundred one billion, forty-one million, four hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •