Base | Representation |
---|---|
bin | 101001001001000… |
… | …1101011001000101 |
3 | 10120012122221001122 |
4 | 1102102031121011 |
5 | 10311402131112 |
6 | 344553003325 |
7 | 46132046243 |
oct | 12222153105 |
9 | 3505587048 |
10 | 1380505157 |
11 | 649293a59 |
12 | 3263b3545 |
13 | 190014275 |
14 | d14b9793 |
15 | 812e3872 |
hex | 5248d645 |
1380505157 has 2 divisors, whose sum is σ = 1380505158. Its totient is φ = 1380505156.
The previous prime is 1380505141. The next prime is 1380505163. The reversal of 1380505157 is 7515050831.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1358217316 + 22287841 = 36854^2 + 4721^2 .
It is an emirp because it is prime and its reverse (7515050831) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1380505157 - 24 = 1380505141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1380505177) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 690252578 + 690252579.
It is an arithmetic number, because the mean of its divisors is an integer number (690252579).
Almost surely, 21380505157 is an apocalyptic number.
It is an amenable number.
1380505157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1380505157 is an equidigital number, since it uses as much as digits as its factorization.
1380505157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21000, while the sum is 35.
The square root of 1380505157 is about 37155.1498045695. The cubic root of 1380505157 is about 1113.4721126817.
Adding to 1380505157 its reverse (7515050831), we get a palindrome (8895555988).
The spelling of 1380505157 in words is "one billion, three hundred eighty million, five hundred five thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •