Base | Representation |
---|---|
bin | 10010011010000001000001… |
… | …110001110101001110110000 |
3 | 101121121222221011120210211210 |
4 | 102122001001301311032300 |
5 | 41102312010134132021 |
6 | 444101044355440120 |
7 | 23023431030404250 |
oct | 2232010161651660 |
9 | 347558834523753 |
10 | 80952647177136 |
11 | 2388090899a389 |
12 | 90b51b98b6040 |
13 | 3622a5693b537 |
14 | 15dc1b40ad960 |
15 | 955b6de08e76 |
hex | 49a041c753b0 |
80952647177136 has 80 divisors (see below), whose sum is σ = 241236727075584. Its totient is φ = 22913165812992.
The previous prime is 80952647177123. The next prime is 80952647177137. The reversal of 80952647177136 is 63177174625908.
It is a super-2 number, since 2×809526471771362 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (80952647177137) 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 15 ways as a sum of consecutive naturals, for example, 1125807495 + ... + 1125879398.
It is a 1-persistent number, because it is pandigital, but 2⋅80952647177136 = 161905294354272 is not.
Almost surely, 280952647177136 is an apocalyptic number.
It is an amenable number.
80952647177136 is an abundant number, since it is smaller than the sum of its proper divisors (160284079898448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
80952647177136 is a wasteful number, since it uses less digits than its factorization.
80952647177136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2251687018 (or 2251687012 counting only the distinct ones).
The product of its (nonzero) digits is 106686720, while the sum is 66.
The spelling of 80952647177136 in words is "eighty trillion, nine hundred fifty-two billion, six hundred forty-seven million, one hundred seventy-seven thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •