Base | Representation |
---|---|
bin | 101000110110100… |
… | …0100101101000001 |
3 | 10112112100100021012 |
4 | 1101231010231001 |
5 | 10301404121431 |
6 | 344004210305 |
7 | 45653232461 |
oct | 12155045501 |
9 | 3475310235 |
10 | 1370770241 |
11 | 643844a75 |
12 | 323099995 |
13 | 18acb6269 |
14 | d00a3ba1 |
15 | 8051e22b |
hex | 51b44b41 |
1370770241 has 2 divisors, whose sum is σ = 1370770242. Its totient is φ = 1370770240.
The previous prime is 1370770229. The next prime is 1370770279. The reversal of 1370770241 is 1420770731.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 966961216 + 403809025 = 31096^2 + 20095^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1370770241 is a prime.
It is a super-2 number, since 2×13707702412 = 3758022107222396162, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1370770198 and 1370770207.
It is not a weakly prime, because it can be changed into another prime (1370770201) 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, 685385120 + 685385121.
It is an arithmetic number, because the mean of its divisors is an integer number (685385121).
Almost surely, 21370770241 is an apocalyptic number.
It is an amenable number.
1370770241 is a deficient number, since it is larger than the sum of its proper divisors (1).
1370770241 is an equidigital number, since it uses as much as digits as its factorization.
1370770241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8232, while the sum is 32.
The square root of 1370770241 is about 37023.9144472866. The cubic root of 1370770241 is about 1110.8486438154.
The spelling of 1370770241 in words is "one billion, three hundred seventy million, seven hundred seventy thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •