Base | Representation |
---|---|
bin | 10001010011011011100… |
… | …100100111111111001100 |
3 | 11012200021001121210021120 |
4 | 101103123210213333030 |
5 | 123440231231104342 |
6 | 2310132420000540 |
7 | 151623606622143 |
oct | 21233344477714 |
9 | 4180231553246 |
10 | 1189094784972 |
11 | 419324008696 |
12 | 172555530150 |
13 | 881921c9253 |
14 | 417a408c75a |
15 | 20de7620aec |
hex | 114db927fcc |
1189094784972 has 24 divisors (see below), whose sum is σ = 2779413628992. Its totient is φ = 395670766800.
The previous prime is 1189094784971. The next prime is 1189094784979. The reversal of 1189094784972 is 2794874909811.
It is a junction number, because it is equal to n+sod(n) for n = 1189094784897 and 1189094784906.
It is not an unprimeable number, because it can be changed into a prime (1189094784971) 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, 86763054 + ... + 86776757.
It is an arithmetic number, because the mean of its divisors is an integer number (115808901208).
Almost surely, 21189094784972 is an apocalyptic number.
1189094784972 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1189094784972 is an abundant number, since it is smaller than the sum of its proper divisors (1590318844020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1189094784972 is a wasteful number, since it uses less digits than its factorization.
1189094784972 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173540389 (or 173540387 counting only the distinct ones).
The product of its (nonzero) digits is 73156608, while the sum is 69.
The spelling of 1189094784972 in words is "one trillion, one hundred eighty-nine billion, ninety-four million, seven hundred eighty-four thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •