Base | Representation |
---|---|
bin | 1010000111100100010111… |
… | …0011111010011110100011 |
3 | 1110101112220220010020000001 |
4 | 2201321011303322132203 |
5 | 2424233234423032121 |
6 | 35354452301440431 |
7 | 2225523153154645 |
oct | 241710563723643 |
9 | 43345826106001 |
10 | 11125136533411 |
11 | 35aa1645a566a |
12 | 12b8161870117 |
13 | 6291328324b4 |
14 | 2a6660b60895 |
15 | 1445cc585991 |
hex | a1e45cfa7a3 |
11125136533411 has 4 divisors (see below), whose sum is σ = 11779556329512. Its totient is φ = 10470716737312.
The previous prime is 11125136533391. The next prime is 11125136533451. The reversal of 11125136533411 is 11433563152111.
It is a happy number.
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 11125136533411 - 27 = 11125136533283 is a prime.
It is a super-2 number, since 2×111251365334112 (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 (11125136533451) 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, 327209898025 + ... + 327209898058.
It is an arithmetic number, because the mean of its divisors is an integer number (2944889082378).
Almost surely, 211125136533411 is an apocalyptic number.
11125136533411 is a deficient number, since it is larger than the sum of its proper divisors (654419796101).
11125136533411 is an equidigital number, since it uses as much as digits as its factorization.
11125136533411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 654419796100.
The product of its digits is 32400, while the sum is 37.
Adding to 11125136533411 its reverse (11433563152111), we get a palindrome (22558699685522).
The spelling of 11125136533411 in words is "eleven trillion, one hundred twenty-five billion, one hundred thirty-six million, five hundred thirty-three thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •