Base | Representation |
---|---|
bin | 10100101011001110… |
… | …10101011000011001 |
3 | 1001122120201000100212 |
4 | 22111213111120121 |
5 | 140213103112334 |
6 | 5033240340505 |
7 | 542032606430 |
oct | 122547253031 |
9 | 31576630325 |
10 | 11100050969 |
11 | 4786764647 |
12 | 2199474735 |
13 | 107b8883c7 |
14 | 7742b6117 |
15 | 44e753ece |
hex | 2959d5619 |
11100050969 has 8 divisors (see below), whose sum is σ = 12729071040. Its totient is φ = 9481855536.
The previous prime is 11100050947. The next prime is 11100050987. The reversal of 11100050969 is 96905000111.
It is a happy number.
11100050969 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11100050969 - 28 = 11100050713 is a prime.
It is a super-2 number, since 2×111000509692 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11100050869) 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 7 ways as a sum of consecutive naturals, for example, 2703959 + ... + 2708060.
It is an arithmetic number, because the mean of its divisors is an integer number (1591133880).
Almost surely, 211100050969 is an apocalyptic number.
It is an amenable number.
11100050969 is a deficient number, since it is larger than the sum of its proper divisors (1629020071).
11100050969 is an equidigital number, since it uses as much as digits as its factorization.
11100050969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5412319.
The product of its (nonzero) digits is 2430, while the sum is 32.
The spelling of 11100050969 in words is "eleven billion, one hundred million, fifty thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •