Base | Representation |
---|---|
bin | 100011101101110000110000… |
… | …1111011000100000100000001 |
3 | 1112012022201002221202122001021 |
4 | 1013123201201323010010001 |
5 | 312134034243034143323 |
6 | 3032051434441505441 |
7 | 123112533346236361 |
oct | 10733414173040401 |
9 | 1465281087678037 |
10 | 314152730771713 |
11 | 9110a474637489 |
12 | 2b298aa1aa2281 |
13 | 1063a6245a6c62 |
14 | 57811051b89a1 |
15 | 264bc77e4e05d |
hex | 11db861ec4101 |
314152730771713 has 2 divisors, whose sum is σ = 314152730771714. Its totient is φ = 314152730771712.
The previous prime is 314152730771683. The next prime is 314152730771731. The reversal of 314152730771713 is 317177037251413.
Together with next prime (314152730771731) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 294765907887504 + 19386822884209 = 17168748^2 + 4403047^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-314152730771713 is a prime.
It is not a weakly prime, because it can be changed into another prime (314152730771213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 157076365385856 + 157076365385857.
It is an arithmetic number, because the mean of its divisors is an integer number (157076365385857).
Almost surely, 2314152730771713 is an apocalyptic number.
It is an amenable number.
314152730771713 is a deficient number, since it is larger than the sum of its proper divisors (1).
314152730771713 is an equidigital number, since it uses as much as digits as its factorization.
314152730771713 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2593080, while the sum is 52.
The spelling of 314152730771713 in words is "three hundred fourteen trillion, one hundred fifty-two billion, seven hundred thirty million, seven hundred seventy-one thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •