Base | Representation |
---|---|
bin | 101000110100001… |
… | …0010010000110101 |
3 | 10112102222120111001 |
4 | 1101220102100311 |
5 | 10301043440221 |
6 | 343521243301 |
7 | 45636454165 |
oct | 12150222065 |
9 | 3472876431 |
10 | 1369515061 |
11 | 643067a32 |
12 | 322793531 |
13 | 18a966b55 |
14 | cdc585a5 |
15 | 80372391 |
hex | 51a12435 |
1369515061 has 2 divisors, whose sum is σ = 1369515062. Its totient is φ = 1369515060.
The previous prime is 1369515011. The next prime is 1369515107. The reversal of 1369515061 is 1605159631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1363012561 + 6502500 = 36919^2 + 2550^2 .
It is a cyclic number.
It is not a de Polignac number, because 1369515061 - 213 = 1369506869 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1369515061.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1369515011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 684757530 + 684757531.
It is an arithmetic number, because the mean of its divisors is an integer number (684757531).
Almost surely, 21369515061 is an apocalyptic number.
It is an amenable number.
1369515061 is a deficient number, since it is larger than the sum of its proper divisors (1).
1369515061 is an equidigital number, since it uses as much as digits as its factorization.
1369515061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24300, while the sum is 37.
The square root of 1369515061 is about 37006.9596292373. The cubic root of 1369515061 is about 1110.5094815072.
The spelling of 1369515061 in words is "one billion, three hundred sixty-nine million, five hundred fifteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •