Base | Representation |
---|---|
bin | 10010001110000110000001… |
… | …111100010011111010110011 |
3 | 101111201200021101002122100202 |
4 | 102032012001330103322303 |
5 | 41000401133014200223 |
6 | 442232434022105415 |
7 | 22610305660143413 |
oct | 2216060174237263 |
9 | 344650241078322 |
10 | 80133384912563 |
11 | 2359541778a174 |
12 | 8ba247857b26b |
13 | 35937130a9498 |
14 | 15b0695820643 |
15 | 93e6bea24428 |
hex | 48e181f13eb3 |
80133384912563 has 8 divisors (see below), whose sum is σ = 82308169528032. Its totient is φ = 77959074900096.
The previous prime is 80133384912533. The next prime is 80133384912583. The reversal of 80133384912563 is 36521948333108.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 80133384912563 - 214 = 80133384896179 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 80133384912499 and 80133384912508.
It is not an unprimeable number, because it can be changed into a prime (80133384912533) 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, 118308470 + ... + 118983867.
It is an arithmetic number, because the mean of its divisors is an integer number (10288521191004).
Almost surely, 280133384912563 is an apocalyptic number.
80133384912563 is a deficient number, since it is larger than the sum of its proper divisors (2174784615469).
80133384912563 is a wasteful number, since it uses less digits than its factorization.
80133384912563 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237301501.
The product of its (nonzero) digits is 11197440, while the sum is 56.
The spelling of 80133384912563 in words is "eighty trillion, one hundred thirty-three billion, three hundred eighty-four million, nine hundred twelve thousand, five hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •