Base | Representation |
---|---|
bin | 1001001001011110000… |
… | …11110001100111010101 |
3 | 1010001022122112200112201 |
4 | 10210233003301213111 |
5 | 20122212431201123 |
6 | 400221514044501 |
7 | 31465124014453 |
oct | 4445703614725 |
9 | 1101278480481 |
10 | 314322131413 |
11 | 111337715644 |
12 | 50b01a19731 |
13 | 238430b6b94 |
14 | 112db30d9d3 |
15 | 8299c235ad |
hex | 492f0f19d5 |
314322131413 has 4 divisors (see below), whose sum is σ = 314326837728. Its totient is φ = 314317425100.
The previous prime is 314322131393. The next prime is 314322131449. The reversal of 314322131413 is 314131223413.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 314322131413 - 225 = 314288576981 is a prime.
It is a super-2 number, since 2×3143221314132 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (314322131213) 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, 2251513 + ... + 2387038.
It is an arithmetic number, because the mean of its divisors is an integer number (78581709432).
Almost surely, 2314322131413 is an apocalyptic number.
It is an amenable number.
314322131413 is a deficient number, since it is larger than the sum of its proper divisors (4706315).
314322131413 is an equidigital number, since it uses as much as digits as its factorization.
314322131413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4706314.
The product of its digits is 5184, while the sum is 28.
Adding to 314322131413 its reverse (314131223413), we get a palindrome (628453354826).
The spelling of 314322131413 in words is "three hundred fourteen billion, three hundred twenty-two million, one hundred thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •