Base | Representation |
---|---|
bin | 1001001001111111010… |
… | …01000100010101011001 |
3 | 1010002001001001021220212 |
4 | 10210333221010111121 |
5 | 20123300141432443 |
6 | 400305253100505 |
7 | 31505042535545 |
oct | 4447751042531 |
9 | 1102031037825 |
10 | 314600342873 |
11 | 11146a767a73 |
12 | 50b7b027735 |
13 | 2388892644b |
14 | 11326250a25 |
15 | 82b437b618 |
hex | 493fa44559 |
314600342873 has 2 divisors, whose sum is σ = 314600342874. Its totient is φ = 314600342872.
The previous prime is 314600342843. The next prime is 314600342879. The reversal of 314600342873 is 378243006413.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 301211075929 + 13389266944 = 548827^2 + 115712^2 .
It is a cyclic number.
It is not a de Polignac number, because 314600342873 - 210 = 314600341849 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 314600342873.
It is not a weakly prime, because it can be changed into another prime (314600342879) 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 as a sum of consecutive naturals, namely, 157300171436 + 157300171437.
It is an arithmetic number, because the mean of its divisors is an integer number (157300171437).
Almost surely, 2314600342873 is an apocalyptic number.
It is an amenable number.
314600342873 is a deficient number, since it is larger than the sum of its proper divisors (1).
314600342873 is an equidigital number, since it uses as much as digits as its factorization.
314600342873 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 290304, while the sum is 41.
The spelling of 314600342873 in words is "three hundred fourteen billion, six hundred million, three hundred forty-two thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •