Base | Representation |
---|---|
bin | 1001101001010100110001… |
… | …10110110001000010101011 |
3 | 2210002202120221020120021200 |
4 | 10310222120312301002223 |
5 | 10240010324412014011 |
6 | 113040130100535243 |
7 | 4316311103462064 |
oct | 464523066610253 |
9 | 83082527216250 |
10 | 21211113001131 |
11 | 6838645353389 |
12 | 2466a329b1523 |
13 | bab27903c451 |
14 | 5348a266d56b |
15 | 26bb3a4d2856 |
hex | 134a98db10ab |
21211113001131 has 24 divisors (see below), whose sum is σ = 31970661365760. Its totient is φ = 13525805223216.
The previous prime is 21211113001129. The next prime is 21211113001189. The reversal of 21211113001131 is 13110031111212.
21211113001131 is a `hidden beast` number, since 2 + 121 + 111 + 300 + 1 + 131 = 666.
It is not a de Polignac number, because 21211113001131 - 21 = 21211113001129 is a prime.
It is a super-2 number, since 2×212111130011312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21211113001121) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 26297220 + ... + 27091806.
It is an arithmetic number, because the mean of its divisors is an integer number (1332110890240).
Almost surely, 221211113001131 is an apocalyptic number.
21211113001131 is a deficient number, since it is larger than the sum of its proper divisors (10759548364629).
21211113001131 is a wasteful number, since it uses less digits than its factorization.
21211113001131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 923575 (or 923572 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
Adding to 21211113001131 its reverse (13110031111212), we get a palindrome (34321144112343).
The spelling of 21211113001131 in words is "twenty-one trillion, two hundred eleven billion, one hundred thirteen million, one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •