Base | Representation |
---|---|
bin | 100000011001101… |
… | …0101000111101000 |
3 | 2210202202100211110 |
4 | 1000303111013220 |
5 | 4211310311142 |
6 | 255514230320 |
7 | 35641012341 |
oct | 10063250750 |
9 | 2722670743 |
10 | 1087197672 |
11 | 508770780 |
12 | 2641253a0 |
13 | 14431a742 |
14 | a45690c8 |
15 | 656a799c |
hex | 40cd51e8 |
1087197672 has 64 divisors (see below), whose sum is σ = 3094018560. Its totient is φ = 315128000.
The previous prime is 1087197641. The next prime is 1087197673. The reversal of 1087197672 is 2767917801.
It is a super-4 number, since 4×10871976724 (a number of 37 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (1087197673) 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 15 ways as a sum of consecutive naturals, for example, 83454 + ... + 95597.
It is an arithmetic number, because the mean of its divisors is an integer number (48344040).
Almost surely, 21087197672 is an apocalyptic number.
1087197672 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1087197672 is an abundant number, since it is smaller than the sum of its proper divisors (2006820888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1087197672 is a wasteful number, since it uses less digits than its factorization.
1087197672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 179094 (or 179090 counting only the distinct ones).
The product of its (nonzero) digits is 296352, while the sum is 48.
The square root of 1087197672 is about 32972.6806917484. The cubic root of 1087197672 is about 1028.2597540898.
The spelling of 1087197672 in words is "one billion, eighty-seven million, one hundred ninety-seven thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •