Base | Representation |
---|---|
bin | 1010001101110000100110… |
… | …0110110010101110101001 |
3 | 1110202201110120221211201020 |
4 | 2203130021212302232221 |
5 | 2433004103131040431 |
6 | 35515402525443053 |
7 | 2236310025163344 |
oct | 243341146625651 |
9 | 43681416854636 |
10 | 11231500643241 |
11 | 364028634366a |
12 | 13148a6a10489 |
13 | 6361839942a8 |
14 | 2ab8710d145b |
15 | 14725537c696 |
hex | a37099b2ba9 |
11231500643241 has 8 divisors (see below), whose sum is σ = 15491725025280. Its totient is φ = 7229471678352.
The previous prime is 11231500643227. The next prime is 11231500643263. The reversal of 11231500643241 is 14234600513211.
11231500643241 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 not a de Polignac number, because 11231500643241 - 222 = 11231496448937 is a prime.
It is a super-2 number, since 2×112315006432412 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11231500643201) 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, 64548854185 + ... + 64548854358.
It is an arithmetic number, because the mean of its divisors is an integer number (1936465628160).
Almost surely, 211231500643241 is an apocalyptic number.
It is an amenable number.
11231500643241 is a deficient number, since it is larger than the sum of its proper divisors (4260224382039).
11231500643241 is a wasteful number, since it uses less digits than its factorization.
11231500643241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 129097708575.
The product of its (nonzero) digits is 17280, while the sum is 33.
The spelling of 11231500643241 in words is "eleven trillion, two hundred thirty-one billion, five hundred million, six hundred forty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •