Base | Representation |
---|---|
bin | 111110111000110… |
… | …0000100010010001 |
3 | 12110001120201121212 |
4 | 1331301200202101 |
5 | 13310143132241 |
6 | 545215225505 |
7 | 103201545305 |
oct | 17561404221 |
9 | 5401521555 |
10 | 2110130321 |
11 | 993128162 |
12 | 4aa818295 |
13 | 278226b30 |
14 | 160365d05 |
15 | c53b8beb |
hex | 7dc60891 |
2110130321 has 24 divisors (see below), whose sum is σ = 2421235320. Its totient is φ = 1827735552.
The previous prime is 2110130317. The next prime is 2110130327. The reversal of 2110130321 is 1230310112.
It can be written as a sum of positive squares in 12 ways, for example, as 126675025 + 1983455296 = 11255^2 + 44536^2 .
It is not a de Polignac number, because 2110130321 - 22 = 2110130317 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2110130296 and 2110130305.
It is not an unprimeable number, because it can be changed into a prime (2110130327) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1716335 + ... + 1717563.
It is an arithmetic number, because the mean of its divisors is an integer number (100884805).
Almost surely, 22110130321 is an apocalyptic number.
It is an amenable number.
2110130321 is a deficient number, since it is larger than the sum of its proper divisors (311104999).
2110130321 is a wasteful number, since it uses less digits than its factorization.
2110130321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1733 (or 1716 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 2110130321 is about 45936.1548347269. The cubic root of 2110130321 is about 1282.6350179762.
Adding to 2110130321 its reverse (1230310112), we get a palindrome (3340440433).
The spelling of 2110130321 in words is "two billion, one hundred ten million, one hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •