Base | Representation |
---|---|
bin | 1011011001110001010… |
… | …11110101110001101101 |
3 | 1101110021201201122000121 |
4 | 11230320223311301231 |
5 | 22404343004243433 |
6 | 455553124324541 |
7 | 40206665616241 |
oct | 5547053656155 |
9 | 1343251648017 |
10 | 391793040493 |
11 | 141181a59238 |
12 | 63b22843751 |
13 | 2ac3b27529a |
14 | 14d6a224421 |
15 | a2d116bc2d |
hex | 5b38af5c6d |
391793040493 has 2 divisors, whose sum is σ = 391793040494. Its totient is φ = 391793040492.
The previous prime is 391793040491. The next prime is 391793040571. The reversal of 391793040493 is 394040397193.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 320812358409 + 70980682084 = 566403^2 + 266422^2 .
It is a cyclic number.
It is not a de Polignac number, because 391793040493 - 21 = 391793040491 is a prime.
Together with 391793040491, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 391793040493.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (391793040491) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 195896520246 + 195896520247.
It is an arithmetic number, because the mean of its divisors is an integer number (195896520247).
Almost surely, 2391793040493 is an apocalyptic number.
It is an amenable number.
391793040493 is a deficient number, since it is larger than the sum of its proper divisors (1).
391793040493 is an equidigital number, since it uses as much as digits as its factorization.
391793040493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2204496, while the sum is 52.
The spelling of 391793040493 in words is "three hundred ninety-one billion, seven hundred ninety-three million, forty thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •