Base | Representation |
---|---|
bin | 11111000001110111110… |
… | …001010110001010000011 |
3 | 21112211212120111000000100 |
4 | 133001313301112022003 |
5 | 234413434140001311 |
6 | 4311323212053443 |
7 | 310024465114323 |
oct | 37016761261203 |
9 | 7484776430010 |
10 | 2132313203331 |
11 | 752344239903 |
12 | 2a530b464283 |
13 | 1260cb75496c |
14 | 752c1263283 |
15 | 3a6ede6ea56 |
hex | 1f077c56283 |
2132313203331 has 12 divisors (see below), whose sum is σ = 3080038221520. Its totient is φ = 1421528168880.
The previous prime is 2132313203329. The next prime is 2132313203341. The reversal of 2132313203331 is 1333023132312.
2132313203331 is a `hidden beast` number, since 2 + 1 + 3 + 2 + 3 + 1 + 320 + 3 + 331 = 666.
It is not a de Polignac number, because 2132313203331 - 21 = 2132313203329 is a prime.
It is a super-2 number, since 2×21323132033312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2132313203295 and 2132313203304.
It is not an unprimeable number, because it can be changed into a prime (2132313203341) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 150535 + ... + 2070576.
Almost surely, 22132313203331 is an apocalyptic number.
2132313203331 is a deficient number, since it is larger than the sum of its proper divisors (947725018189).
2132313203331 is a wasteful number, since it uses less digits than its factorization.
2132313203331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2327786 (or 2327783 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 27.
Adding to 2132313203331 its reverse (1333023132312), we get a palindrome (3465336335643).
The spelling of 2132313203331 in words is "two trillion, one hundred thirty-two billion, three hundred thirteen million, two hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •