Base | Representation |
---|---|
bin | 1011100100100000110… |
… | …01100110100110101011 |
3 | 1102000011121120022210122 |
4 | 11302100121212212223 |
5 | 23003200230401214 |
6 | 502345242233455 |
7 | 40502620013345 |
oct | 5622031464653 |
9 | 1360147508718 |
10 | 397559622059 |
11 | 143671051326 |
12 | 65071ab588b |
13 | 2b649b85b22 |
14 | 15356032295 |
15 | a51c54888e |
hex | 5c906669ab |
397559622059 has 4 divisors (see below), whose sum is σ = 399223051680. Its totient is φ = 395896192440.
The previous prime is 397559622017. The next prime is 397559622079. The reversal of 397559622059 is 950226955793.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 950226955793 = 117203 ⋅8107531.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-397559622059 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 397559621992 and 397559622010.
It is not an unprimeable number, because it can be changed into a prime (397559622079) 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, 831714452 + ... + 831714929.
It is an arithmetic number, because the mean of its divisors is an integer number (99805762920).
Almost surely, 2397559622059 is an apocalyptic number.
397559622059 is a deficient number, since it is larger than the sum of its proper divisors (1663429621).
397559622059 is a wasteful number, since it uses less digits than its factorization.
397559622059 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1663429620.
The product of its (nonzero) digits is 45927000, while the sum is 62.
The spelling of 397559622059 in words is "three hundred ninety-seven billion, five hundred fifty-nine million, six hundred twenty-two thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •