Base | Representation |
---|---|
bin | 10010101110100… |
… | …101111111101101 |
3 | 210220020020001102 |
4 | 102232211333231 |
5 | 1120414013031 |
6 | 51102252445 |
7 | 10533456026 |
oct | 2256457755 |
9 | 726206042 |
10 | 314204141 |
11 | 1513a6249 |
12 | 89287125 |
13 | 50132114 |
14 | 2da2dc4d |
15 | 1c8b77cb |
hex | 12ba5fed |
314204141 has 4 divisors (see below), whose sum is σ = 314247612. Its totient is φ = 314160672.
The previous prime is 314204123. The next prime is 314204171. The reversal of 314204141 is 141402413.
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 66015625 + 248188516 = 8125^2 + 15754^2 .
It is a cyclic number.
It is not a de Polignac number, because 314204141 - 222 = 310009837 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 (314204171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8000 + ... + 26313.
It is an arithmetic number, because the mean of its divisors is an integer number (78561903).
Almost surely, 2314204141 is an apocalyptic number.
It is an amenable number.
314204141 is a deficient number, since it is larger than the sum of its proper divisors (43471).
314204141 is an equidigital number, since it uses as much as digits as its factorization.
314204141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43470.
The product of its (nonzero) digits is 384, while the sum is 20.
The square root of 314204141 is about 17725.8043823122. The cubic root of 314204141 is about 679.8357020884.
Adding to 314204141 its reverse (141402413), we get a palindrome (455606554).
The spelling of 314204141 in words is "three hundred fourteen million, two hundred four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •