Base | Representation |
---|---|
bin | 1001100100101111011010… |
… | …0100111010000001101110 |
3 | 1101021100112021001201100122 |
4 | 2121023312210322001232 |
5 | 2334432400011321243 |
6 | 34215540453524542 |
7 | 2134352040655022 |
oct | 231136644720156 |
9 | 41240467051318 |
10 | 10526806745198 |
11 | 3399436a79997 |
12 | 12201ba343752 |
13 | 5b489ac21ab3 |
14 | 28570064a382 |
15 | 133c5e185668 |
hex | 992f693a06e |
10526806745198 has 12 divisors (see below), whose sum is σ = 16009477454088. Its totient is φ = 5191301951280.
The previous prime is 10526806745197. The next prime is 10526806745201. The reversal of 10526806745198 is 89154760862501.
10526806745198 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×105268067451982 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10526806745198.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10526806745197) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 493834658 + ... + 493855973.
It is an arithmetic number, because the mean of its divisors is an integer number (1334123121174).
Almost surely, 210526806745198 is an apocalyptic number.
10526806745198 is a deficient number, since it is larger than the sum of its proper divisors (5482670708890).
10526806745198 is an frugal number, since it uses more digits than its factorization.
10526806745198 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 987690779 (or 987690706 counting only the distinct ones).
The product of its (nonzero) digits is 29030400, while the sum is 62.
The spelling of 10526806745198 in words is "ten trillion, five hundred twenty-six billion, eight hundred six million, seven hundred forty-five thousand, one hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •