Base | Representation |
---|---|
bin | 10010101110101… |
… | …000101011101111 |
3 | 210220020210011012 |
4 | 102232220223233 |
5 | 1120414341101 |
6 | 51102415435 |
7 | 10533533105 |
oct | 2256505357 |
9 | 726223135 |
10 | 314215151 |
11 | 151403548 |
12 | 8929157b |
13 | 50137133 |
14 | 2da33c75 |
15 | 1c8babbb |
hex | 12ba8aef |
314215151 has 4 divisors (see below), whose sum is σ = 314255304. Its totient is φ = 314175000.
The previous prime is 314215133. The next prime is 314215157. The reversal of 314215151 is 151512413.
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 314215151 - 226 = 247106287 is a prime.
It is a super-2 number, since 2×3142151512 = 197462322235905602, which 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 (314215157) 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 3 ways as a sum of consecutive naturals, for example, 4100 + ... + 25401.
It is an arithmetic number, because the mean of its divisors is an integer number (78563826).
Almost surely, 2314215151 is an apocalyptic number.
314215151 is a deficient number, since it is larger than the sum of its proper divisors (40153).
314215151 is a wasteful number, since it uses less digits than its factorization.
314215151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40152.
The product of its digits is 600, while the sum is 23.
The square root of 314215151 is about 17726.1149437772. The cubic root of 314215151 is about 679.8436426836.
Adding to 314215151 its reverse (151512413), we get a palindrome (465727564).
The spelling of 314215151 in words is "three hundred fourteen million, two hundred fifteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •