Base | Representation |
---|---|
bin | 10000101111111100001… |
… | …001011101011000010000 |
3 | 11002000220020100201111010 |
4 | 100233330021131120100 |
5 | 122324210032343341 |
6 | 2240431141250520 |
7 | 146104343504625 |
oct | 20577411353020 |
9 | 4060806321433 |
10 | 1150986606096 |
11 | 404148a29888 |
12 | 16709b103a40 |
13 | 846cb075892 |
14 | 3d9cac5a34c |
15 | 1ee16c7d716 |
hex | 10bfc25d610 |
1150986606096 has 40 divisors (see below), whose sum is σ = 2973449999520. Its totient is φ = 383653436416.
The previous prime is 1150986606073. The next prime is 1150986606097. The reversal of 1150986606096 is 6906066890511.
It is a happy number.
It is a super-2 number, since 2×11509866060962 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1150986606097) 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 7 ways as a sum of consecutive naturals, for example, 2052571 + ... + 2552453.
It is an arithmetic number, because the mean of its divisors is an integer number (74336249988).
Almost surely, 21150986606096 is an apocalyptic number.
1150986606096 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1150986606096 is an abundant number, since it is smaller than the sum of its proper divisors (1822463393424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1150986606096 is a wasteful number, since it uses less digits than its factorization.
1150986606096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 547863 (or 547857 counting only the distinct ones).
The product of its (nonzero) digits is 4199040, while the sum is 57.
The spelling of 1150986606096 in words is "one trillion, one hundred fifty billion, nine hundred eighty-six million, six hundred six thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •