Base | Representation |
---|---|
bin | 1001110100100101010111… |
… | …0011011111111101110100 |
3 | 1102020101001222212211101011 |
4 | 2131021111303133331310 |
5 | 2403412311230031110 |
6 | 34544553012442004 |
7 | 2163125654622544 |
oct | 235112563377564 |
9 | 42211058784334 |
10 | 10798987345780 |
11 | 34939089116a7 |
12 | 1264abb019304 |
13 | 604456386cca |
14 | 294960bb1324 |
15 | 13ad8e3a448a |
hex | 9d255cdff74 |
10798987345780 has 48 divisors (see below), whose sum is σ = 22751884681344. Its totient is φ = 4305498894720.
The previous prime is 10798987345763. The next prime is 10798987345789. The reversal of 10798987345780 is 8754378989701.
It is a junction number, because it is equal to n+sod(n) for n = 10798987345697 and 10798987345706.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10798987345789) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 257754514 + ... + 257796406.
It is an arithmetic number, because the mean of its divisors is an integer number (473997597528).
Almost surely, 210798987345780 is an apocalyptic number.
10798987345780 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10798987345780 is an abundant number, since it is smaller than the sum of its proper divisors (11952897335564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10798987345780 is a wasteful number, since it uses less digits than its factorization.
10798987345780 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83656 (or 83654 counting only the distinct ones).
The product of its (nonzero) digits is 853493760, while the sum is 76.
The spelling of 10798987345780 in words is "ten trillion, seven hundred ninety-eight billion, nine hundred eighty-seven million, three hundred forty-five thousand, seven hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •