Base | Representation |
---|---|
bin | 10101111101100000… |
… | …01100100101111001 |
3 | 1010102200102020220001 |
4 | 22332300030211321 |
5 | 143121300140441 |
6 | 5225533433001 |
7 | 565113246622 |
oct | 127660144571 |
9 | 33380366801 |
10 | 11790240121 |
11 | 5000312a00 |
12 | 235063b761 |
13 | 115b87105a |
14 | 7dbc18a49 |
15 | 490139731 |
hex | 2bec0c979 |
11790240121 has 24 divisors (see below), whose sum is σ = 13074304320. Its totient is φ = 10623882720.
The previous prime is 11790240109. The next prime is 11790240149. The reversal of 11790240121 is 12104209711.
It is not a de Polignac number, because 11790240121 - 25 = 11790240089 is a prime.
It is a super-2 number, since 2×117902401212 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11790240121.
It is not an unprimeable number, because it can be changed into a prime (11790240181) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9188946 + ... + 9190228.
It is an arithmetic number, because the mean of its divisors is an integer number (544762680).
Almost surely, 211790240121 is an apocalyptic number.
11790240121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11790240121 is a deficient number, since it is larger than the sum of its proper divisors (1284064199).
11790240121 is a wasteful number, since it uses less digits than its factorization.
11790240121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1917 (or 1906 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 28.
Adding to 11790240121 its reverse (12104209711), we get a palindrome (23894449832).
The spelling of 11790240121 in words is "eleven billion, seven hundred ninety million, two hundred forty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •