Base | Representation |
---|---|
bin | 10100111000010101… |
… | …10010110101111000 |
3 | 1001221020121111202200 |
4 | 22130022302311320 |
5 | 140424230304401 |
6 | 5052205230200 |
7 | 544536340554 |
oct | 123412626570 |
9 | 31836544680 |
10 | 11210009976 |
11 | 4832838460 |
12 | 220a262360 |
13 | 10985a7bc9 |
14 | 784b3a864 |
15 | 459224686 |
hex | 29c2b2d78 |
11210009976 has 96 divisors (see below), whose sum is σ = 33138443520. Its totient is φ = 3395131200.
The previous prime is 11210009959. The next prime is 11210009977. The reversal of 11210009976 is 67990001211.
11210009976 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 11210009976.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11210009977) 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 23 ways as a sum of consecutive naturals, for example, 2439441 + ... + 2444031.
It is an arithmetic number, because the mean of its divisors is an integer number (345192120).
Almost surely, 211210009976 is an apocalyptic number.
It is an amenable number.
11210009976 is an abundant number, since it is smaller than the sum of its proper divisors (21928433544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11210009976 is a wasteful number, since it uses less digits than its factorization.
11210009976 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7697 (or 7690 counting only the distinct ones).
The product of its (nonzero) digits is 6804, while the sum is 36.
The spelling of 11210009976 in words is "eleven billion, two hundred ten million, nine thousand, nine hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •