Base | Representation |
---|---|
bin | 1001110110100011010011… |
… | …1001101111100011100000 |
3 | 1102100121100010002022011120 |
4 | 2131220310321233203200 |
5 | 2404441031014311421 |
6 | 35012303425412240 |
7 | 2165433521562300 |
oct | 235506471574340 |
9 | 42317303068146 |
10 | 10832795072736 |
11 | 34a718745430a |
12 | 126b57519a080 |
13 | 6076b3590580 |
14 | 29644abdd600 |
15 | 13bbbc4238c6 |
hex | 9da34e6f8e0 |
10832795072736 has 144 divisors (see below), whose sum is σ = 35623230151824. Its totient is φ = 2857000882176.
The previous prime is 10832795072717. The next prime is 10832795072761. The reversal of 10832795072736 is 63727059723801.
It is a self number, because there is not a number n which added to its sum of digits gives 10832795072736.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 88511545 + ... + 88633848.
It is an arithmetic number, because the mean of its divisors is an integer number (247383542721).
Almost surely, 210832795072736 is an apocalyptic number.
10832795072736 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
10832795072736 is an abundant number, since it is smaller than the sum of its proper divisors (24790435079088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10832795072736 is a wasteful number, since it uses less digits than its factorization.
10832795072736 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177145433 (or 177145418 counting only the distinct ones).
The product of its (nonzero) digits is 26671680, while the sum is 60.
The spelling of 10832795072736 in words is "ten trillion, eight hundred thirty-two billion, seven hundred ninety-five million, seventy-two thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •