Base | Representation |
---|---|
bin | 10010011100010100110101… |
… | …111100010111010111011110 |
3 | 101122012011121022021121100110 |
4 | 102130110311330113113132 |
5 | 41112412032233324013 |
6 | 444302013453510450 |
7 | 23041050113506533 |
oct | 2234246574272736 |
9 | 348164538247313 |
10 | 81111362401758 |
11 | 23932154563807 |
12 | 911bb131a2426 |
13 | 36349cb970b30 |
14 | 1605b4d106d8a |
15 | 959d5cbb22c3 |
hex | 49c535f175de |
81111362401758 has 96 divisors (see below), whose sum is σ = 179152656328800. Its totient is φ = 24336888791040.
The previous prime is 81111362401723. The next prime is 81111362401859. The reversal of 81111362401758 is 85710426311118.
It is a super-2 number, since 2×811113624017582 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 273757438 + ... + 274053566.
It is an arithmetic number, because the mean of its divisors is an integer number (1866173503425).
Almost surely, 281111362401758 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 81111362401758, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (89576328164400).
81111362401758 is an abundant number, since it is smaller than the sum of its proper divisors (98041293927042).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
81111362401758 is a wasteful number, since it uses less digits than its factorization.
81111362401758 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 298318 (or 298277 counting only the distinct ones).
The product of its (nonzero) digits is 322560, while the sum is 48.
The spelling of 81111362401758 in words is "eighty-one trillion, one hundred eleven billion, three hundred sixty-two million, four hundred one thousand, seven hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •