Base | Representation |
---|---|
bin | 100000100110011… |
… | …0010010101100101 |
3 | 2211020022101211212 |
4 | 1001030302111211 |
5 | 4220012332244 |
6 | 300313241205 |
7 | 36051515063 |
oct | 10114622545 |
9 | 2736271755 |
10 | 1093870949 |
11 | 511509486 |
12 | 266403205 |
13 | 145816022 |
14 | a53c5033 |
15 | 66074d9e |
hex | 41332565 |
1093870949 has 8 divisors (see below), whose sum is σ = 1098504288. Its totient is φ = 1089245680.
The previous prime is 1093870889. The next prime is 1093870963. The reversal of 1093870949 is 9490783901.
1093870949 is nontrivially palindromic in base 7.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1093870949 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1093870897 and 1093870906.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1093870979) 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 7 ways as a sum of consecutive naturals, for example, 565514 + ... + 567444.
It is an arithmetic number, because the mean of its divisors is an integer number (137313036).
Almost surely, 21093870949 is an apocalyptic number.
It is an amenable number.
1093870949 is a deficient number, since it is larger than the sum of its proper divisors (4633339).
1093870949 is a wasteful number, since it uses less digits than its factorization.
1093870949 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4035.
The product of its (nonzero) digits is 489888, while the sum is 50.
The square root of 1093870949 is about 33073.7199147601. The cubic root of 1093870949 is about 1030.3593018636.
The spelling of 1093870949 in words is "one billion, ninety-three million, eight hundred seventy thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •