Base | Representation |
---|---|
bin | 11111000001110010111… |
… | …000001100011000010101 |
3 | 21112211122212000100011120 |
4 | 133001302320030120111 |
5 | 234413302131042323 |
6 | 4311311120354153 |
7 | 310022450261526 |
oct | 37016270143025 |
9 | 7484585010146 |
10 | 2132231112213 |
11 | 75230196a604 |
12 | 2a52a7a75959 |
13 | 1260b7741837 |
14 | 752b43b484d |
15 | 3a6e6b565e3 |
hex | 1f072e0c615 |
2132231112213 has 16 divisors (see below), whose sum is σ = 2969257530240. Its totient is φ = 1358457514304.
The previous prime is 2132231112181. The next prime is 2132231112251. The reversal of 2132231112213 is 3122111322312.
It is a cyclic number.
It is not a de Polignac number, because 2132231112213 - 25 = 2132231112181 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2132231122213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13855806 + ... + 14008847.
It is an arithmetic number, because the mean of its divisors is an integer number (185578595640).
Almost surely, 22132231112213 is an apocalyptic number.
2132231112213 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2132231112213 is a deficient number, since it is larger than the sum of its proper divisors (837026418027).
2132231112213 is a wasteful number, since it uses less digits than its factorization.
2132231112213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27865788.
The product of its digits is 864, while the sum is 24.
Adding to 2132231112213 its reverse (3122111322312), we get a palindrome (5254342434525).
The spelling of 2132231112213 in words is "two trillion, one hundred thirty-two billion, two hundred thirty-one million, one hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •