Base | Representation |
---|---|
bin | 1011100110111000010… |
… | …10111101001100101101 |
3 | 1102010110012121102212212 |
4 | 11303130022331030231 |
5 | 23013301144211421 |
6 | 503115333140205 |
7 | 40546254203642 |
oct | 5633412751455 |
9 | 1363405542785 |
10 | 398830850861 |
11 | 144163688343 |
12 | 6536778a665 |
13 | 2b7c0359211 |
14 | 15436bc3dc9 |
15 | a593e53e5b |
hex | 5cdc2bd32d |
398830850861 has 2 divisors, whose sum is σ = 398830850862. Its totient is φ = 398830850860.
The previous prime is 398830850837. The next prime is 398830850867. The reversal of 398830850861 is 168058038893.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 349854505225 + 48976345636 = 591485^2 + 221306^2 .
It is a cyclic number.
It is not a de Polignac number, because 398830850861 - 214 = 398830834477 is a prime.
It is a super-4 number, since 4×3988308508614 (a number of 48 digits) contains 4444 as substring.
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 398830850861.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (398830850867) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 199415425430 + 199415425431.
It is an arithmetic number, because the mean of its divisors is an integer number (199415425431).
Almost surely, 2398830850861 is an apocalyptic number.
It is an amenable number.
398830850861 is a deficient number, since it is larger than the sum of its proper divisors (1).
398830850861 is an equidigital number, since it uses as much as digits as its factorization.
398830850861 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9953280, while the sum is 59.
The spelling of 398830850861 in words is "three hundred ninety-eight billion, eight hundred thirty million, eight hundred fifty thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •