Base | Representation |
---|---|
bin | 101000111001101… |
… | …0011110101111101 |
3 | 10112122102101220011 |
4 | 1101303103311331 |
5 | 10302313430432 |
6 | 344103223221 |
7 | 46003152046 |
oct | 12163236575 |
9 | 3478371804 |
10 | 1372405117 |
11 | 644761306 |
12 | 323747b11 |
13 | 18b439445 |
14 | d03ab8cd |
15 | 80743847 |
hex | 51cd3d7d |
1372405117 has 2 divisors, whose sum is σ = 1372405118. Its totient is φ = 1372405116.
The previous prime is 1372405103. The next prime is 1372405127. The reversal of 1372405117 is 7115042731.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 886907961 + 485497156 = 29781^2 + 22034^2 .
It is an emirp because it is prime and its reverse (7115042731) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1372405117 - 211 = 1372403069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1372405127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 686202558 + 686202559.
It is an arithmetic number, because the mean of its divisors is an integer number (686202559).
Almost surely, 21372405117 is an apocalyptic number.
It is an amenable number.
1372405117 is a deficient number, since it is larger than the sum of its proper divisors (1).
1372405117 is an equidigital number, since it uses as much as digits as its factorization.
1372405117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5880, while the sum is 31.
The square root of 1372405117 is about 37045.9865167605. The cubic root of 1372405117 is about 1111.2900934980.
Adding to 1372405117 its reverse (7115042731), we get a palindrome (8487447848).
The spelling of 1372405117 in words is "one billion, three hundred seventy-two million, four hundred five thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •