Base | Representation |
---|---|
bin | 101000110100100… |
… | …1001001100111001 |
3 | 10112110102000011102 |
4 | 1101221021030321 |
5 | 10301123140324 |
6 | 343530141145 |
7 | 45641412224 |
oct | 12151111471 |
9 | 3473360142 |
10 | 1369740089 |
11 | 643201003 |
12 | 3228817b5 |
13 | 18aa153c3 |
14 | cdcb65bb |
15 | 803b8dae |
hex | 51a49339 |
1369740089 has 2 divisors, whose sum is σ = 1369740090. Its totient is φ = 1369740088.
The previous prime is 1369740079. The next prime is 1369740121. The reversal of 1369740089 is 9800479631.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1169092864 + 200647225 = 34192^2 + 14165^2 .
It is an emirp because it is prime and its reverse (9800479631) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1369740089 is a prime.
It is a super-2 number, since 2×13697400892 = 3752375822827455842, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1369740079) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 684870044 + 684870045.
It is an arithmetic number, because the mean of its divisors is an integer number (684870045).
Almost surely, 21369740089 is an apocalyptic number.
It is an amenable number.
1369740089 is a deficient number, since it is larger than the sum of its proper divisors (1).
1369740089 is an equidigital number, since it uses as much as digits as its factorization.
1369740089 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 326592, while the sum is 47.
The square root of 1369740089 is about 37009.9998513915. Note that the first 3 decimals coincide. The cubic root of 1369740089 is about 1110.5703015860.
The spelling of 1369740089 in words is "one billion, three hundred sixty-nine million, seven hundred forty thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •