Base | Representation |
---|---|
bin | 100000001110100… |
… | …1010011010011001 |
3 | 2210100211010121101 |
4 | 1000131022122121 |
5 | 4203313333044 |
6 | 255145511401 |
7 | 35540430520 |
oct | 10035123231 |
9 | 2710733541 |
10 | 1081386649 |
11 | 505461882 |
12 | 2621a2561 |
13 | 143064775 |
14 | a38954b7 |
15 | 64e0acd4 |
hex | 4074a699 |
1081386649 has 4 divisors (see below), whose sum is σ = 1235870464. Its totient is φ = 926902836.
The previous prime is 1081386629. The next prime is 1081386673. The reversal of 1081386649 is 9466831801.
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 1081386649 - 215 = 1081353881 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1081386599 and 1081386608.
It is not an unprimeable number, because it can be changed into a prime (1081386629) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 77241897 + ... + 77241910.
It is an arithmetic number, because the mean of its divisors is an integer number (308967616).
Almost surely, 21081386649 is an apocalyptic number.
It is an amenable number.
1081386649 is a deficient number, since it is larger than the sum of its proper divisors (154483815).
1081386649 is an equidigital number, since it uses as much as digits as its factorization.
1081386649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154483814.
The product of its (nonzero) digits is 248832, while the sum is 46.
The square root of 1081386649 is about 32884.4438754862. The cubic root of 1081386649 is about 1026.4244795551.
The spelling of 1081386649 in words is "one billion, eighty-one million, three hundred eighty-six thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •