Base | Representation |
---|---|
bin | 1010001110010100011001… |
… | …1000011000100111010111 |
3 | 1110210122021022001110112101 |
4 | 2203211012120120213113 |
5 | 2433133243203223111 |
6 | 35524032244102531 |
7 | 2240100122153101 |
oct | 243450630304727 |
9 | 43718238043471 |
10 | 11241110211031 |
11 | 3644367728128 |
12 | 1316729094a47 |
13 | 63705581008c |
14 | 2ac103460571 |
15 | 147618d16bc1 |
hex | a39466189d7 |
11241110211031 has 8 divisors (see below), whose sum is σ = 11258646805728. Its totient is φ = 11223575220000.
The previous prime is 11241110211011. The next prime is 11241110211061. The reversal of 11241110211031 is 13011201114211.
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 11241110211031 - 25 = 11241110210999 is a prime.
It is a super-2 number, since 2×112411102110312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11241110211011) 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, 14034006 + ... + 14813356.
It is an arithmetic number, because the mean of its divisors is an integer number (1407330850716).
Almost surely, 211241110211031 is an apocalyptic number.
11241110211031 is a deficient number, since it is larger than the sum of its proper divisors (17536594697).
11241110211031 is an equidigital number, since it uses as much as digits as its factorization.
11241110211031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 801833.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 11241110211031 its reverse (13011201114211), we get a palindrome (24252311325242).
The spelling of 11241110211031 in words is "eleven trillion, two hundred forty-one billion, one hundred ten million, two hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •