Base | Representation |
---|---|
bin | 10010100100010000000001… |
… | …110011000010111110001000 |
3 | 101201010020021102220012200012 |
4 | 102210100001303002332020 |
5 | 41200322340241442110 |
6 | 445400120321331052 |
7 | 23125306344155015 |
oct | 2244200163027610 |
9 | 351106242805605 |
10 | 81655948390280 |
11 | 24022103111300 |
12 | 91a9577a96a88 |
13 | 3674179cc3a24 |
14 | 16242519c870c |
15 | 9690d2c03905 |
hex | 4a4401cc2f88 |
81655948390280 has 96 divisors (see below), whose sum is σ = 206643066537600. Its totient is φ = 29002535506560.
The previous prime is 81655948390273. The next prime is 81655948390339. The reversal of 81655948390280 is 8209384955618.
It is a super-3 number, since 3×816559483902803 (a number of 43 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 81655948390280.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 195967040 + ... + 196383279.
It is an arithmetic number, because the mean of its divisors is an integer number (2152531943100).
Almost surely, 281655948390280 is an apocalyptic number.
It is an amenable number.
81655948390280 is an abundant number, since it is smaller than the sum of its proper divisors (124987118147320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
81655948390280 is a wasteful number, since it uses less digits than its factorization.
81655948390280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 392350395 (or 392350380 counting only the distinct ones).
The product of its (nonzero) digits is 149299200, while the sum is 68.
The spelling of 81655948390280 in words is "eighty-one trillion, six hundred fifty-five billion, nine hundred forty-eight million, three hundred ninety thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •