Base | Representation |
---|---|
bin | 1001001001000111101… |
… | …11010000111001111011 |
3 | 1010000211120002222111001 |
4 | 10210203313100321323 |
5 | 20121321340133311 |
6 | 400151124145431 |
7 | 31460353341013 |
oct | 4444367207173 |
9 | 1100746088431 |
10 | 314134302331 |
11 | 1112506958a3 |
12 | 50a6ab38277 |
13 | 23813201605 |
14 | 112c03b8c43 |
15 | 82884c04c1 |
hex | 4923dd0e7b |
314134302331 has 4 divisors (see below), whose sum is σ = 319458612600. Its totient is φ = 308809992064.
The previous prime is 314134302311. The next prime is 314134302337. The reversal of 314134302331 is 133203431413.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 314134302331 - 215 = 314134269563 is a prime.
It is a super-2 number, since 2×3141343023312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 314134302331.
It is not an unprimeable number, because it can be changed into a prime (314134302337) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2662155046 + ... + 2662155163.
It is an arithmetic number, because the mean of its divisors is an integer number (79864653150).
Almost surely, 2314134302331 is an apocalyptic number.
314134302331 is a deficient number, since it is larger than the sum of its proper divisors (5324310269).
314134302331 is an equidigital number, since it uses as much as digits as its factorization.
314134302331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5324310268.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 314134302331 its reverse (133203431413), we get a palindrome (447337733744).
The spelling of 314134302331 in words is "three hundred fourteen billion, one hundred thirty-four million, three hundred two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •