Base | Representation |
---|---|
bin | 101001111000011… |
… | …0101100110011101 |
3 | 10121221100012210222 |
4 | 1103300311212131 |
5 | 10334224431024 |
6 | 351240411125 |
7 | 46552643516 |
oct | 12360654635 |
9 | 3557305728 |
10 | 1405311389 |
11 | 661297279 |
12 | 332776aa5 |
13 | 1951bb201 |
14 | d48d5a0d |
15 | 8359385e |
hex | 53c3599d |
1405311389 has 2 divisors, whose sum is σ = 1405311390. Its totient is φ = 1405311388.
The previous prime is 1405311311. The next prime is 1405311407. The reversal of 1405311389 is 9831135041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1329185764 + 76125625 = 36458^2 + 8725^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1405311389 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1405311289) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 702655694 + 702655695.
It is an arithmetic number, because the mean of its divisors is an integer number (702655695).
Almost surely, 21405311389 is an apocalyptic number.
It is an amenable number.
1405311389 is a deficient number, since it is larger than the sum of its proper divisors (1).
1405311389 is an equidigital number, since it uses as much as digits as its factorization.
1405311389 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 35.
The square root of 1405311389 is about 37487.4830976954. The cubic root of 1405311389 is about 1120.1018691888.
The spelling of 1405311389 in words is "one billion, four hundred five million, three hundred eleven thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •