Base | Representation |
---|---|
bin | 101000100101101… |
… | …0000111010100001 |
3 | 10111220200001200101 |
4 | 1101023100322201 |
5 | 10242122013421 |
6 | 343050222401 |
7 | 45515010253 |
oct | 12113207241 |
9 | 3456601611 |
10 | 1361907361 |
11 | 639841181 |
12 | 320124a01 |
13 | 189202159 |
14 | ccc37cd3 |
15 | 7e86d191 |
hex | 512d0ea1 |
1361907361 has 2 divisors, whose sum is σ = 1361907362. Its totient is φ = 1361907360.
The previous prime is 1361907353. The next prime is 1361907389. The reversal of 1361907361 is 1637091631.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1354240000 + 7667361 = 36800^2 + 2769^2 .
It is a cyclic number.
It is not a de Polignac number, because 1361907361 - 23 = 1361907353 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1361907361.
It is not a weakly prime, because it can be changed into another prime (1361907311) 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, 680953680 + 680953681.
It is an arithmetic number, because the mean of its divisors is an integer number (680953681).
Almost surely, 21361907361 is an apocalyptic number.
It is an amenable number.
1361907361 is a deficient number, since it is larger than the sum of its proper divisors (1).
1361907361 is an equidigital number, since it uses as much as digits as its factorization.
1361907361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20412, while the sum is 37.
The square root of 1361907361 is about 36904.0290618789. The cubic root of 1361907361 is about 1108.4493568604.
Adding to 1361907361 its reverse (1637091631), we get a palindrome (2998998992).
The spelling of 1361907361 in words is "one billion, three hundred sixty-one million, nine hundred seven thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •