Base | Representation |
---|---|
bin | 1000100111101101… |
… | …0111101100010100 |
3 | 12222021021112001011 |
4 | 2021323113230110 |
5 | 14214343322012 |
6 | 1021341542004 |
7 | 111226014343 |
oct | 21173275424 |
9 | 5867245034 |
10 | 2314042132 |
11 | a88242116 |
12 | 546b74904 |
13 | 2ab5507cc |
14 | 17d485b5a |
15 | d82471a7 |
hex | 89ed7b14 |
2314042132 has 24 divisors (see below), whose sum is σ = 4150864872. Its totient is φ = 1128115200.
The previous prime is 2314042109. The next prime is 2314042139. The reversal of 2314042132 is 2312404132.
It can be written as a sum of positive squares in 4 ways, for example, as 75238276 + 2238803856 = 8674^2 + 47316^2 .
It is a super-2 number, since 2×23140421322 = 10709581977342210848, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2314042139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 361068 + ... + 367420.
It is an arithmetic number, because the mean of its divisors is an integer number (172952703).
Almost surely, 22314042132 is an apocalyptic number.
It is an amenable number.
2314042132 is a deficient number, since it is larger than the sum of its proper divisors (1836822740).
2314042132 is a wasteful number, since it uses less digits than its factorization.
2314042132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8619 (or 8617 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 2314042132 is about 48104.4918068989. The cubic root of 2314042132 is about 1322.6870066919.
Adding to 2314042132 its reverse (2312404132), we get a palindrome (4626446264).
The spelling of 2314042132 in words is "two billion, three hundred fourteen million, forty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •