Base | Representation |
---|---|
bin | 100011101110011110010100… |
… | …1011001100101101011001001 |
3 | 1112012200001122022100202200222 |
4 | 1013130330221121211223021 |
5 | 312142140130040021301 |
6 | 3032204414541435425 |
7 | 123122565665130656 |
oct | 10734745131455311 |
9 | 1465601568322628 |
10 | 314250566720201 |
11 | 91147a0a466661 |
12 | 2b2b3a46b6bb75 |
13 | 10646916960737 |
14 | 5785b46a78c2d |
15 | 264e5a21bd31b |
hex | 11dcf29665ac9 |
314250566720201 has 4 divisors (see below), whose sum is σ = 314364715130772. Its totient is φ = 314136418309632.
The previous prime is 314250566720149. The next prime is 314250566720231. The reversal of 314250566720201 is 102027665052413.
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 238892541910201 + 75358024810000 = 15456149^2 + 8680900^2 .
It is a cyclic number.
It is not a de Polignac number, because 314250566720201 - 226 = 314250499611337 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (314250566720231) 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, 57074201156 + ... + 57074206661.
It is an arithmetic number, because the mean of its divisors is an integer number (78591178782693).
Almost surely, 2314250566720201 is an apocalyptic number.
It is an amenable number.
314250566720201 is a deficient number, since it is larger than the sum of its proper divisors (114148410571).
314250566720201 is a wasteful number, since it uses less digits than its factorization.
314250566720201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 114148410570.
The product of its (nonzero) digits is 604800, while the sum is 44.
The spelling of 314250566720201 in words is "three hundred fourteen trillion, two hundred fifty billion, five hundred sixty-six million, seven hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •