Base | Representation |
---|---|
bin | 101000100100011… |
… | …1100110001111111 |
3 | 10111212112020101000 |
4 | 1101020330301333 |
5 | 10241443104412 |
6 | 343025221343 |
7 | 45506602302 |
oct | 12110746177 |
9 | 3455466330 |
10 | 1361300607 |
11 | 639467327 |
12 | 31ba91853 |
13 | 18904bc24 |
14 | ccb1ab39 |
15 | 7e79d4dc |
hex | 5123cc7f |
1361300607 has 8 divisors (see below), whose sum is σ = 2016741680. Its totient is φ = 907533720.
The previous prime is 1361300599. The next prime is 1361300617. The reversal of 1361300607 is 7060031631.
It is not a de Polignac number, because 1361300607 - 23 = 1361300599 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 50418541 = 1361300607 / (1 + 3 + 6 + 1 + 3 + 0 + 0 + 6 + 0 + 7).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1361300617) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25209244 + ... + 25209297.
It is an arithmetic number, because the mean of its divisors is an integer number (252092710).
Almost surely, 21361300607 is an apocalyptic number.
1361300607 is a deficient number, since it is larger than the sum of its proper divisors (655441073).
1361300607 is an equidigital number, since it uses as much as digits as its factorization.
1361300607 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50418550 (or 50418544 counting only the distinct ones).
The product of its (nonzero) digits is 2268, while the sum is 27.
The square root of 1361300607 is about 36895.8074447491. The cubic root of 1361300607 is about 1108.2847210945.
The spelling of 1361300607 in words is "one billion, three hundred sixty-one million, three hundred thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •