Base | Representation |
---|---|
bin | 10101110011110100… |
… | …10011000100101100 |
3 | 1010020000112221011210 |
4 | 22321322103010230 |
5 | 142440001031103 |
6 | 5213512314420 |
7 | 563105606103 |
oct | 127172230454 |
9 | 33200487153 |
10 | 11709002028 |
11 | 4a69476589 |
12 | 23293a2a10 |
13 | 1147a99289 |
14 | 7d110d03a |
15 | 487e3de03 |
hex | 2b9e9312c |
11709002028 has 18 divisors (see below), whose sum is σ = 27321879396. Its totient is φ = 3902875728.
The previous prime is 11709001987. The next prime is 11709002029. The reversal of 11709002028 is 82020090711.
11709002028 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×117090020282 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11709001986 and 11709002004.
It is not an unprimeable number, because it can be changed into a prime (11709002029) 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 5 ways as a sum of consecutive naturals, for example, 359226 + ... + 390462.
Almost surely, 211709002028 is an apocalyptic number.
It is an amenable number.
11709002028 is an abundant number, since it is smaller than the sum of its proper divisors (15612877368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11709002028 is an frugal number, since it uses more digits than its factorization.
11709002028 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62481 (or 31242 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 30.
Adding to 11709002028 its reverse (82020090711), we get a palindrome (93729092739).
The spelling of 11709002028 in words is "eleven billion, seven hundred nine million, two thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •