Base | Representation |
---|---|
bin | 1001110010101110101111… |
… | …0011000101010110101000 |
3 | 1102010022212210011100211000 |
4 | 2130223223303011112220 |
5 | 2402402102341041213 |
6 | 34522205133035000 |
7 | 2160620603422413 |
oct | 234535363052650 |
9 | 42108783140730 |
10 | 10767144080808 |
11 | 3481358153395 |
12 | 125a8b2925a60 |
13 | 60145016419b |
14 | 2931bda2ab7a |
15 | 13a128a27c73 |
hex | 9caebcc55a8 |
10767144080808 has 64 divisors (see below), whose sum is σ = 29914672032000. Its totient is φ = 3588335410176.
The previous prime is 10767144080807. The next prime is 10767144080821. The reversal of 10767144080808 is 80808044176701.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is not an unprimeable number, because it can be changed into a prime (10767144080807) 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 15 ways as a sum of consecutive naturals, for example, 3857785 + ... + 6034632.
It is an arithmetic number, because the mean of its divisors is an integer number (467416750500).
Almost surely, 210767144080808 is an apocalyptic number.
10767144080808 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
10767144080808 is an abundant number, since it is smaller than the sum of its proper divisors (19147527951192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10767144080808 is a wasteful number, since it uses less digits than its factorization.
10767144080808 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9897471 (or 9897461 counting only the distinct ones).
The product of its (nonzero) digits is 2408448, while the sum is 54.
The spelling of 10767144080808 in words is "ten trillion, seven hundred sixty-seven billion, one hundred forty-four million, eighty thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •