Base | Representation |
---|---|
bin | 101000001111110… |
… | …0010100110110101 |
3 | 10111010002201221202 |
4 | 1100133202212311 |
5 | 10231203223433 |
6 | 342000422245 |
7 | 45315411605 |
oct | 12037424665 |
9 | 3433081852 |
10 | 1350445493 |
11 | 633322761 |
12 | 318317985 |
13 | 186a1b097 |
14 | cb4d2c05 |
15 | 7d856ee8 |
hex | 507e29b5 |
1350445493 has 2 divisors, whose sum is σ = 1350445494. Its totient is φ = 1350445492.
The previous prime is 1350445451. The next prime is 1350445531. The reversal of 1350445493 is 3945440531.
It is an a-pointer prime, because the next prime (1350445531) can be obtained adding 1350445493 to its sum of digits (38).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 929457169 + 420988324 = 30487^2 + 20518^2 .
It is an emirp because it is prime and its reverse (3945440531) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1350445493 - 26 = 1350445429 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1350445433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 675222746 + 675222747.
It is an arithmetic number, because the mean of its divisors is an integer number (675222747).
Almost surely, 21350445493 is an apocalyptic number.
It is an amenable number.
1350445493 is a deficient number, since it is larger than the sum of its proper divisors (1).
1350445493 is an equidigital number, since it uses as much as digits as its factorization.
1350445493 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 129600, while the sum is 38.
The square root of 1350445493 is about 36748.4080335462. The cubic root of 1350445493 is about 1105.3310073512.
The spelling of 1350445493 in words is "one billion, three hundred fifty million, four hundred forty-five thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •