Base | Representation |
---|---|
bin | 10011101011100000… |
… | …110111110011100011 |
3 | 2000112122221201211101 |
4 | 103223200313303203 |
5 | 321234032212011 |
6 | 13412453255231 |
7 | 1345435442134 |
oct | 235340676343 |
9 | 60478851741 |
10 | 21131132131 |
11 | 8a63a7836a |
12 | 4118934517 |
13 | 1cb9b389a5 |
14 | 1046609c8b |
15 | 83a2012c1 |
hex | 4eb837ce3 |
21131132131 has 8 divisors (see below), whose sum is σ = 22472611280. Its totient is φ = 19812584448.
The previous prime is 21131132119. The next prime is 21131132149. The reversal of 21131132131 is 13123113112.
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 21131132131 - 27 = 21131132003 is a prime.
It is a super-2 number, since 2×211311321312 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21131132099 and 21131132108.
It is not an unprimeable number, because it can be changed into a prime (21131132531) 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, 5730966 + ... + 5734651.
It is an arithmetic number, because the mean of its divisors is an integer number (2809076410).
Almost surely, 221131132131 is an apocalyptic number.
21131132131 is a deficient number, since it is larger than the sum of its proper divisors (1341479149).
21131132131 is a wasteful number, since it uses less digits than its factorization.
21131132131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11465733.
The product of its digits is 108, while the sum is 19.
Adding to 21131132131 its reverse (13123113112), we get a palindrome (34254245243).
The spelling of 21131132131 in words is "twenty-one billion, one hundred thirty-one million, one hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •