Base | Representation |
---|---|
bin | 101101110101101… |
… | …0001100110101001 |
3 | 10222012011002200212 |
4 | 1123223101212221 |
5 | 11122221232303 |
6 | 412342110505 |
7 | 53054246606 |
oct | 13353214651 |
9 | 3865132625 |
10 | 1538070953 |
11 | 71a223521 |
12 | 36b11b435 |
13 | 1b6861a73 |
14 | 1083b36ad |
15 | 90069ad8 |
hex | 5bad19a9 |
1538070953 has 2 divisors, whose sum is σ = 1538070954. Its totient is φ = 1538070952.
The previous prime is 1538070899. The next prime is 1538070959. The reversal of 1538070953 is 3590708351.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1464745984 + 73324969 = 38272^2 + 8563^2 .
It is a cyclic number.
It is not a de Polignac number, because 1538070953 - 26 = 1538070889 is a prime.
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 1538070953.
It is not a weakly prime, because it can be changed into another prime (1538070959) 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, 769035476 + 769035477.
It is an arithmetic number, because the mean of its divisors is an integer number (769035477).
Almost surely, 21538070953 is an apocalyptic number.
It is an amenable number.
1538070953 is a deficient number, since it is larger than the sum of its proper divisors (1).
1538070953 is an equidigital number, since it uses as much as digits as its factorization.
1538070953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 113400, while the sum is 41.
The square root of 1538070953 is about 39218.2477043531. The cubic root of 1538070953 is about 1154.3179704336.
The spelling of 1538070953 in words is "one billion, five hundred thirty-eight million, seventy thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •