Base | Representation |
---|---|
bin | 101000110011010… |
… | …1110100000011101 |
3 | 10112102012210222201 |
4 | 1101212232200131 |
5 | 10300442401321 |
6 | 343504411501 |
7 | 45633133012 |
oct | 12146564035 |
9 | 3472183881 |
10 | 1369106461 |
11 | 642908a48 |
12 | 322616b91 |
13 | 18a852b88 |
14 | cdb8d709 |
15 | 802e1291 |
hex | 519ae81d |
1369106461 has 2 divisors, whose sum is σ = 1369106462. Its totient is φ = 1369106460.
The previous prime is 1369106429. The next prime is 1369106467. The reversal of 1369106461 is 1646019631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1222551225 + 146555236 = 34965^2 + 12106^2 .
It is a cyclic number.
It is not a de Polignac number, because 1369106461 - 25 = 1369106429 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1369106461.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1369106467) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 684553230 + 684553231.
It is an arithmetic number, because the mean of its divisors is an integer number (684553231).
Almost surely, 21369106461 is an apocalyptic number.
It is an amenable number.
1369106461 is a deficient number, since it is larger than the sum of its proper divisors (1).
1369106461 is an equidigital number, since it uses as much as digits as its factorization.
1369106461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 37.
The square root of 1369106461 is about 37001.4386341937. The cubic root of 1369106461 is about 1110.3990289533.
The spelling of 1369106461 in words is "one billion, three hundred sixty-nine million, one hundred six thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •