Base | Representation |
---|---|
bin | 10010101110111… |
… | …110101111111011 |
3 | 210220102101010121 |
4 | 102232332233323 |
5 | 1120430234111 |
6 | 51104354111 |
7 | 10534360441 |
oct | 2256765773 |
9 | 726371117 |
10 | 314305531 |
11 | 151465441 |
12 | 89315937 |
13 | 50169307 |
14 | 2da58b91 |
15 | 1c8d7871 |
hex | 12bbebfb |
314305531 has 4 divisors (see below), whose sum is σ = 314341000. Its totient is φ = 314270064.
The previous prime is 314305501. The next prime is 314305553. The reversal of 314305531 is 135503413.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 314305531 - 25 = 314305499 is a prime.
It is a super-2 number, since 2×3143055312 = 197575933634383922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 314305496 and 314305505.
It is not an unprimeable number, because it can be changed into a prime (314305501) 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, 8215 + ... + 26383.
It is an arithmetic number, because the mean of its divisors is an integer number (78585250).
Almost surely, 2314305531 is an apocalyptic number.
314305531 is a deficient number, since it is larger than the sum of its proper divisors (35469).
314305531 is a wasteful number, since it uses less digits than its factorization.
314305531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35468.
The product of its (nonzero) digits is 2700, while the sum is 25.
The square root of 314305531 is about 17728.6641064689. The cubic root of 314305531 is about 679.9088192332.
Adding to 314305531 its reverse (135503413), we get a palindrome (449808944).
The spelling of 314305531 in words is "three hundred fourteen million, three hundred five thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •