Base | Representation |
---|---|
bin | 101100100010110… |
… | …0011100101010101 |
3 | 10212011102000010021 |
4 | 1121011203211111 |
5 | 11030111104233 |
6 | 404151025141 |
7 | 52016064025 |
oct | 13105434525 |
9 | 3764360107 |
10 | 1494628693 |
11 | 6a7751728 |
12 | 35866b1b1 |
13 | 1aa86149c |
14 | 102705a85 |
15 | 8b337e2d |
hex | 59163955 |
1494628693 has 2 divisors, whose sum is σ = 1494628694. Its totient is φ = 1494628692.
The previous prime is 1494628691. The next prime is 1494628783. The reversal of 1494628693 is 3968264941.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1248703569 + 245925124 = 35337^2 + 15682^2 .
It is a cyclic number.
It is not a de Polignac number, because 1494628693 - 21 = 1494628691 is a prime.
It is a super-4 number, since 4×14946286934 (a number of 38 digits) contains 4444 as substring.
Together with 1494628691, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1494628693.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1494628691) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 747314346 + 747314347.
It is an arithmetic number, because the mean of its divisors is an integer number (747314347).
Almost surely, 21494628693 is an apocalyptic number.
It is an amenable number.
1494628693 is a deficient number, since it is larger than the sum of its proper divisors (1).
1494628693 is an equidigital number, since it uses as much as digits as its factorization.
1494628693 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2239488, while the sum is 52.
The square root of 1494628693 is about 38660.4279981482. The cubic root of 1494628693 is about 1143.3462502448.
The spelling of 1494628693 in words is "one billion, four hundred ninety-four million, six hundred twenty-eight thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •