Base | Representation |
---|---|
bin | 1010000111111110000101… |
… | …0011110100000010010011 |
3 | 1110102012202000211111110021 |
4 | 2201333201103310002103 |
5 | 2424341404311101121 |
6 | 35401553322044311 |
7 | 2226156223400626 |
oct | 241774123640223 |
9 | 43365660744407 |
10 | 11132040331411 |
11 | 360208761224a |
12 | 12b9569949697 |
13 | 629992c2457c |
14 | 2a6b179d7dbd |
15 | 1448836ea641 |
hex | a1fe14f4093 |
11132040331411 has 4 divisors (see below), whose sum is σ = 11432906286352. Its totient is φ = 10831174376472.
The previous prime is 11132040331409. The next prime is 11132040331439. The reversal of 11132040331411 is 11413304023111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11132040331411 - 21 = 11132040331409 is a prime.
It is a super-2 number, since 2×111320403314112 (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 (11132040334411) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 150432977415 + ... + 150432977488.
It is an arithmetic number, because the mean of its divisors is an integer number (2858226571588).
Almost surely, 211132040331411 is an apocalyptic number.
11132040331411 is a deficient number, since it is larger than the sum of its proper divisors (300865954941).
11132040331411 is an equidigital number, since it uses as much as digits as its factorization.
11132040331411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 300865954940.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 11132040331411 its reverse (11413304023111), we get a palindrome (22545344354522).
The spelling of 11132040331411 in words is "eleven trillion, one hundred thirty-two billion, forty million, three hundred thirty-one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •