Base | Representation |
---|---|
bin | 10000011101000000111… |
… | …111011001100011000101 |
3 | 11000002110002222121102002 |
4 | 100131000333121203011 |
5 | 122011101142313024 |
6 | 2223230544355045 |
7 | 144454655614145 |
oct | 20350077314305 |
9 | 4002402877362 |
10 | 1130666760389 |
11 | 3a6570a00a71 |
12 | 16316a015a85 |
13 | 8281034203a |
14 | 3ca202b6925 |
15 | 1e627dd36ae |
hex | 10740fd98c5 |
1130666760389 has 4 divisors (see below), whose sum is σ = 1156961336256. Its totient is φ = 1104372184524.
The previous prime is 1130666760319. The next prime is 1130666760409. The reversal of 1130666760389 is 9830676660311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1130666760389 - 224 = 1130649983173 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130666760319) 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 in 3 ways as a sum of consecutive naturals, for example, 13147287869 + ... + 13147287954.
It is an arithmetic number, because the mean of its divisors is an integer number (289240334064).
Almost surely, 21130666760389 is an apocalyptic number.
It is an amenable number.
1130666760389 is a deficient number, since it is larger than the sum of its proper divisors (26294575867).
1130666760389 is an equidigital number, since it uses as much as digits as its factorization.
1130666760389 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26294575866.
The product of its (nonzero) digits is 5878656, while the sum is 56.
The spelling of 1130666760389 in words is "one trillion, one hundred thirty billion, six hundred sixty-six million, seven hundred sixty thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •