Base | Representation |
---|---|
bin | 111111111111110… |
… | …011101101100101 |
3 | 2202211100011211121 |
4 | 333333303231211 |
5 | 4144331111433 |
6 | 254312533541 |
7 | 35415140620 |
oct | 7777635545 |
9 | 2684304747 |
10 | 1073691493 |
11 | 501086346 |
12 | 25b6b12b1 |
13 | 14159c014 |
14 | a2850db7 |
15 | 643dac2d |
hex | 3fff3b65 |
1073691493 has 8 divisors (see below), whose sum is σ = 1260240512. Its totient is φ = 895433616.
The previous prime is 1073691469. The next prime is 1073691517. The reversal of 1073691493 is 3941963701.
It is an interprime number because it is at equal distance from previous prime (1073691469) and next prime (1073691517).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-1073691493 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1073691193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2072505 + ... + 2073022.
It is an arithmetic number, because the mean of its divisors is an integer number (157530064).
Almost surely, 21073691493 is an apocalyptic number.
It is an amenable number.
1073691493 is a deficient number, since it is larger than the sum of its proper divisors (186549019).
1073691493 is an equidigital number, since it uses as much as digits as its factorization.
1073691493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4145571.
The product of its (nonzero) digits is 122472, while the sum is 43.
The square root of 1073691493 is about 32767.2320008877. The cubic root of 1073691493 is about 1023.9839999560.
The spelling of 1073691493 in words is "one billion, seventy-three million, six hundred ninety-one thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •