Base | Representation |
---|---|
bin | 11111000001110111101… |
… | …001000001011000110110 |
3 | 21112211212102101010120100 |
4 | 133001313221001120312 |
5 | 234413433110133420 |
6 | 4311323053214530 |
7 | 310024440425214 |
oct | 37016751013066 |
9 | 7484772333510 |
10 | 2132311021110 |
11 | 752342a89316 |
12 | 2a530a791446 |
13 | 1260cb16c5ca |
14 | 752c0c55cb4 |
15 | 3a6edb8d190 |
hex | 1f077a41636 |
2132311021110 has 48 divisors (see below), whose sum is σ = 5544358878240. Its totient is φ = 568580352000.
The previous prime is 2132311021091. The next prime is 2132311021129. The reversal of 2132311021110 is 111201132312.
2132311021110 is a `hidden beast` number, since 2 + 132 + 311 + 0 + 211 + 10 = 666.
It is an interprime number because it is at equal distance from previous prime (2132311021091) and next prime (2132311021129).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 699751 + ... + 2180429.
It is an arithmetic number, because the mean of its divisors is an integer number (115507476630).
Almost surely, 22132311021110 is an apocalyptic number.
2132311021110 is an abundant number, since it is smaller than the sum of its proper divisors (3412047857130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2132311021110 is a wasteful number, since it uses less digits than its factorization.
2132311021110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1496693 (or 1496690 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 2132311021110 its reverse (111201132312), we get a palindrome (2243512153422).
The spelling of 2132311021110 in words is "two trillion, one hundred thirty-two billion, three hundred eleven million, twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •