Base | Representation |
---|---|
bin | 111110111000101… |
… | …1011111001010010 |
3 | 12110001112202112220 |
4 | 1331301123321102 |
5 | 13310142030224 |
6 | 545215001510 |
7 | 103201436013 |
oct | 17561337122 |
9 | 5401482486 |
10 | 2110111314 |
11 | 993114953 |
12 | 4aa809296 |
13 | 27821b29c |
14 | 16035d00a |
15 | c53b3279 |
hex | 7dc5be52 |
2110111314 has 8 divisors (see below), whose sum is σ = 4220222640. Its totient is φ = 703370436.
The previous prime is 2110111303. The next prime is 2110111319. The reversal of 2110111314 is 4131110112.
It is a sphenic number, since it is the product of 3 distinct primes.
2110111314 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 2110111293 and 2110111302.
It is not an unprimeable number, because it can be changed into a prime (2110111319) 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 3 ways as a sum of consecutive naturals, for example, 175842604 + ... + 175842615.
It is an arithmetic number, because the mean of its divisors is an integer number (527527830).
Almost surely, 22110111314 is an apocalyptic number.
2110111314 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2110111314 is a wasteful number, since it uses less digits than its factorization.
2110111314 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 351685224.
The product of its (nonzero) digits is 24, while the sum is 15.
The square root of 2110111314 is about 45935.9479492913. The cubic root of 2110111314 is about 1282.6311668527.
Adding to 2110111314 its reverse (4131110112), we get a palindrome (6241221426).
The spelling of 2110111314 in words is "two billion, one hundred ten million, one hundred eleven thousand, three hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •