Base | Representation |
---|---|
bin | 10010101110010… |
… | …001111110011101 |
3 | 210220002001120101 |
4 | 102232101332131 |
5 | 1120403402031 |
6 | 51100421101 |
7 | 10532664664 |
oct | 2256217635 |
9 | 726061511 |
10 | 314122141 |
11 | 15134a683 |
12 | 89247791 |
13 | 501039b8 |
14 | 2da0bddb |
15 | 1c89d361 |
hex | 12b91f9d |
314122141 has 4 divisors (see below), whose sum is σ = 332599932. Its totient is φ = 295644352.
The previous prime is 314122111. The next prime is 314122153. The reversal of 314122141 is 141221413.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 212314041 + 101808100 = 14571^2 + 10090^2 .
It is a cyclic number.
It is not a de Polignac number, because 314122141 - 29 = 314121629 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (314122111) 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, 9238870 + ... + 9238903.
It is an arithmetic number, because the mean of its divisors is an integer number (83149983).
Almost surely, 2314122141 is an apocalyptic number.
It is an amenable number.
314122141 is a deficient number, since it is larger than the sum of its proper divisors (18477791).
314122141 is a wasteful number, since it uses less digits than its factorization.
314122141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18477790.
The product of its digits is 192, while the sum is 19.
The square root of 314122141 is about 17723.4912192830. The cubic root of 314122141 is about 679.7765564879.
Adding to 314122141 its reverse (141221413), we get a palindrome (455343554).
The spelling of 314122141 in words is "three hundred fourteen million, one hundred twenty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •