Base | Representation |
---|---|
bin | 1010001110010001001000… |
… | …0111001111100001101001 |
3 | 1110210120000011222212122121 |
4 | 2203210102013033201221 |
5 | 2433124444211131441 |
6 | 35523405240551241 |
7 | 2240036313436255 |
oct | 243442207174151 |
9 | 43716004885577 |
10 | 11240233302121 |
11 | 3643a5773751a |
12 | 1316523482521 |
13 | 636c45c3ca75 |
14 | 2ac05cbd5265 |
15 | 1475b6d4bdd1 |
hex | a39121cf869 |
11240233302121 has 8 divisors (see below), whose sum is σ = 11278760601024. Its totient is φ = 11201707124400.
The previous prime is 11240233302101. The next prime is 11240233302143. The reversal of 11240233302121 is 12120333204211.
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 11240233302121 - 213 = 11240233293929 is a prime.
It is a super-2 number, since 2×112402333021212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11240233302101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23154946 + ... + 23635396.
It is an arithmetic number, because the mean of its divisors is an integer number (1409845075128).
Almost surely, 211240233302121 is an apocalyptic number.
It is an amenable number.
11240233302121 is a deficient number, since it is larger than the sum of its proper divisors (38527298903).
11240233302121 is an equidigital number, since it uses as much as digits as its factorization.
11240233302121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 560591.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 11240233302121 its reverse (12120333204211), we get a palindrome (23360566506332).
The spelling of 11240233302121 in words is "eleven trillion, two hundred forty billion, two hundred thirty-three million, three hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.193 sec. • engine limits •