Base | Representation |
---|---|
bin | 111010101101011… |
… | …1111110110010101 |
3 | 12002021220221210102 |
4 | 1311122333312111 |
5 | 13013310332131 |
6 | 523252103445 |
7 | 66550551611 |
oct | 16532776625 |
9 | 5067827712 |
10 | 1970011541 |
11 | 921024913 |
12 | 46b904b85 |
13 | 2551a7704 |
14 | 1498d0341 |
15 | b7e3c1cb |
hex | 756bfd95 |
1970011541 has 2 divisors, whose sum is σ = 1970011542. Its totient is φ = 1970011540.
The previous prime is 1970011513. The next prime is 1970011543. The reversal of 1970011541 is 1451100791.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1266648100 + 703363441 = 35590^2 + 26521^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1970011541 is a prime.
Together with 1970011543, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1970011543) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 985005770 + 985005771.
It is an arithmetic number, because the mean of its divisors is an integer number (985005771).
Almost surely, 21970011541 is an apocalyptic number.
It is an amenable number.
1970011541 is a deficient number, since it is larger than the sum of its proper divisors (1).
1970011541 is an equidigital number, since it uses as much as digits as its factorization.
1970011541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1260, while the sum is 29.
The square root of 1970011541 is about 44384.8120532238. The cubic root of 1970011541 is about 1253.5921294765.
The spelling of 1970011541 in words is "one billion, nine hundred seventy million, eleven thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •