Base | Representation |
---|---|
bin | 100001101011010111010… |
… | …010101101100111001110 |
3 | 22012020121212001022012022 |
4 | 201223113102231213032 |
5 | 300404143412141420 |
6 | 4531102103210142 |
7 | 326126422632665 |
oct | 41532722554716 |
9 | 8166555038168 |
10 | 2314304412110 |
11 | 812544563679 |
12 | 31463ba46952 |
13 | 13a312a85c52 |
14 | 800276a9ddc |
15 | 403013a0c25 |
hex | 21ad74ad9ce |
2314304412110 has 32 divisors (see below), whose sum is σ = 4167894146112. Its totient is φ = 925244985600.
The previous prime is 2314304412107. The next prime is 2314304412113. The reversal of 2314304412110 is 112144034132.
It is an interprime number because it is at equal distance from previous prime (2314304412107) and next prime (2314304412113).
It is a self number, because there is not a number n which added to its sum of digits gives 2314304412110.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2314304412113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 258548135 + ... + 258557085.
It is an arithmetic number, because the mean of its divisors is an integer number (130246692066).
Almost surely, 22314304412110 is an apocalyptic number.
2314304412110 is a deficient number, since it is larger than the sum of its proper divisors (1853589734002).
2314304412110 is a wasteful number, since it uses less digits than its factorization.
2314304412110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19388.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 2314304412110 its reverse (112144034132), we get a palindrome (2426448446242).
The spelling of 2314304412110 in words is "two trillion, three hundred fourteen billion, three hundred four million, four hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •