Base | Representation |
---|---|
bin | 101101011000111001001000… |
… | …1111001011000011100001101 |
3 | 1221100121111020022100221000111 |
4 | 1122301302101321120130031 |
5 | 404312214113443034423 |
6 | 3533042452324000021 |
7 | 150044346612151606 |
oct | 13261622171303415 |
9 | 1840544208327014 |
10 | 399245427705613 |
11 | 1062370426a6565 |
12 | 38940531b30011 |
13 | 141a08b3ca4678 |
14 | 7083820688dad |
15 | 31254530b260d |
hex | 16b1c91e5870d |
399245427705613 has 2 divisors, whose sum is σ = 399245427705614. Its totient is φ = 399245427705612.
The previous prime is 399245427705577. The next prime is 399245427705617. The reversal of 399245427705613 is 316507724542993.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 375854101719849 + 23391325985764 = 19386957^2 + 4836458^2 .
It is a cyclic number.
It is not a de Polignac number, because 399245427705613 - 245 = 364061055616781 is a prime.
It is a super-2 number, since 2×3992454277056132 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (399245427705617) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 199622713852806 + 199622713852807.
It is an arithmetic number, because the mean of its divisors is an integer number (199622713852807).
Almost surely, 2399245427705613 is an apocalyptic number.
It is an amenable number.
399245427705613 is a deficient number, since it is larger than the sum of its proper divisors (1).
399245427705613 is an equidigital number, since it uses as much as digits as its factorization.
399245427705613 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 342921600, while the sum is 67.
The spelling of 399245427705613 in words is "three hundred ninety-nine trillion, two hundred forty-five billion, four hundred twenty-seven million, seven hundred five thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.211 sec. • engine limits •