Base | Representation |
---|---|
bin | 1001001001010100010… |
… | …10111001001011011011 |
3 | 1010001002221012122010121 |
4 | 10210222022321023123 |
5 | 20122030432030243 |
6 | 400205424054111 |
7 | 31463106606025 |
oct | 4445212711333 |
9 | 1101087178117 |
10 | 314240111323 |
11 | 1112a5394746 |
12 | 50a9a464337 |
13 | 2382c0ca198 |
14 | 112d047d015 |
15 | 82929211ed |
hex | 492a2b92db |
314240111323 has 4 divisors (see below), whose sum is σ = 314276393808. Its totient is φ = 314203828840.
The previous prime is 314240111281. The next prime is 314240111347. The reversal of 314240111323 is 323111042413.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 323111042413 = 28933 ⋅11167561.
It is a cyclic number.
It is not a de Polignac number, because 314240111323 - 225 = 314206556891 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (314240111623) 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, 18128248 + ... + 18145573.
It is an arithmetic number, because the mean of its divisors is an integer number (78569098452).
Almost surely, 2314240111323 is an apocalyptic number.
314240111323 is a deficient number, since it is larger than the sum of its proper divisors (36282485).
314240111323 is an equidigital number, since it uses as much as digits as its factorization.
314240111323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36282484.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 314240111323 its reverse (323111042413), we get a palindrome (637351153736).
The spelling of 314240111323 in words is "three hundred fourteen billion, two hundred forty million, one hundred eleven thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •