Base | Representation |
---|---|
bin | 10101110101110111… |
… | …11001110011000000 |
3 | 1010021012220200100201 |
4 | 22322323321303000 |
5 | 143003401400000 |
6 | 5215325054544 |
7 | 563405025004 |
oct | 127273716300 |
9 | 33235820321 |
10 | 11726200000 |
11 | 4a78152689 |
12 | 23330b7454 |
13 | 114b50b1a8 |
14 | 7d3508704 |
15 | 4896d996a |
hex | 2baef9cc0 |
11726200000 has 84 divisors (see below), whose sum is σ = 29085107184. Its totient is φ = 4690400000.
The previous prime is 11726199983. The next prime is 11726200043. The reversal of 11726200000 is 262711.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 170685 + ... + 229315.
It is an arithmetic number, because the mean of its divisors is an integer number (346251276).
Almost surely, 211726200000 is an apocalyptic number.
11726200000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11726200000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14542553592).
11726200000 is an abundant number, since it is smaller than the sum of its proper divisors (17358907184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11726200000 is an frugal number, since it uses more digits than its factorization.
11726200000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58668 (or 58638 counting only the distinct ones).
The product of its (nonzero) digits is 168, while the sum is 19.
Adding to 11726200000 its reverse (262711), we get a palindrome (11726462711).
The spelling of 11726200000 in words is "eleven billion, seven hundred twenty-six million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •