Base | Representation |
---|---|
bin | 11111000001110001101… |
… | …011111110011001101101 |
3 | 21112211121110102020111011 |
4 | 133001301223332121231 |
5 | 234413232022211023 |
6 | 4311305124225221 |
7 | 310022115404314 |
oct | 37016153763155 |
9 | 7484543366434 |
10 | 2132211132013 |
11 | 7522a1663146 |
12 | 2a52a123b211 |
13 | 1260b3567431 |
14 | 752b189327b |
15 | 3a6e500b50d |
hex | 1f071afe66d |
2132211132013 has 8 divisors (see below), whose sum is σ = 2244488121920. Its totient is φ = 2019939677280.
The previous prime is 2132211131993. The next prime is 2132211132043. The reversal of 2132211132013 is 3102311122312.
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 2132211132013 - 233 = 2123621197421 is a prime.
It is a super-2 number, since 2×21322111320132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2132211132043) 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, 581145 + ... + 2145262.
It is an arithmetic number, because the mean of its divisors is an integer number (280561015240).
Almost surely, 22132211132013 is an apocalyptic number.
It is an amenable number.
2132211132013 is a deficient number, since it is larger than the sum of its proper divisors (112276989907).
2132211132013 is a wasteful number, since it uses less digits than its factorization.
2132211132013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2767587.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 2132211132013 its reverse (3102311122312), we get a palindrome (5234522254325).
The spelling of 2132211132013 in words is "two trillion, one hundred thirty-two billion, two hundred eleven million, one hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •