Base | Representation |
---|---|
bin | 1011100110000101100… |
… | …10111001101011100001 |
3 | 1102002100112111210111221 |
4 | 11303002302321223201 |
5 | 23011413202131333 |
6 | 503005204135041 |
7 | 40532564412223 |
oct | 5630262715341 |
9 | 1362315453457 |
10 | 398405114593 |
11 | 143a65334392 |
12 | 65269097481 |
13 | 2b7530a6575 |
14 | 153d6440413 |
15 | a56b8a9d2d |
hex | 5cc2cb9ae1 |
398405114593 has 2 divisors, whose sum is σ = 398405114594. Its totient is φ = 398405114592.
The previous prime is 398405114587. The next prime is 398405114633. The reversal of 398405114593 is 395411504893.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 313439860449 + 84965254144 = 559857^2 + 291488^2 .
It is an emirp because it is prime and its reverse (395411504893) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 398405114593 - 213 = 398405106401 is a prime.
It is a super-2 number, since 2×3984051145932 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 398405114593.
It is not a weakly prime, because it can be changed into another prime (398405114573) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 199202557296 + 199202557297.
It is an arithmetic number, because the mean of its divisors is an integer number (199202557297).
Almost surely, 2398405114593 is an apocalyptic number.
It is an amenable number.
398405114593 is a deficient number, since it is larger than the sum of its proper divisors (1).
398405114593 is an equidigital number, since it uses as much as digits as its factorization.
398405114593 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2332800, while the sum is 52.
The spelling of 398405114593 in words is "three hundred ninety-eight billion, four hundred five million, one hundred fourteen thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •