Base | Representation |
---|---|
bin | 10100011101111101… |
… | …01100111000000001 |
3 | 1001100211020121221021 |
4 | 22032332230320001 |
5 | 140001104023001 |
6 | 5014222425441 |
7 | 536211500125 |
oct | 121676547001 |
9 | 31324217837 |
10 | 10988736001 |
11 | 4729945001 |
12 | 2168132281 |
13 | 10617b2669 |
14 | 7635bb585 |
15 | 444ab6ba1 |
hex | 28eface01 |
10988736001 has 4 divisors (see below), whose sum is σ = 10990968532. Its totient is φ = 10986503472.
The previous prime is 10988735983. The next prime is 10988736007. The reversal of 10988736001 is 10063788901.
10988736001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2570490000 + 8418246001 = 50700^2 + 91751^2 .
It is a cyclic number.
It is not a de Polignac number, because 10988736001 - 211 = 10988733953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10988736007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1108866 + ... + 1118731.
It is an arithmetic number, because the mean of its divisors is an integer number (2747742133).
Almost surely, 210988736001 is an apocalyptic number.
It is an amenable number.
10988736001 is a deficient number, since it is larger than the sum of its proper divisors (2232531).
10988736001 is an equidigital number, since it uses as much as digits as its factorization.
10988736001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2232530.
The product of its (nonzero) digits is 72576, while the sum is 43.
The spelling of 10988736001 in words is "ten billion, nine hundred eighty-eight million, seven hundred thirty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •