Base | Representation |
---|---|
bin | 1010001000000010001001… |
… | …1000100101010110001001 |
3 | 1110102022120010012010210000 |
4 | 2202000202120211112021 |
5 | 2424401123304213001 |
6 | 35402253522313213 |
7 | 2226225251314431 |
oct | 242004230452611 |
9 | 43368503163700 |
10 | 11133132101001 |
11 | 3602597915969 |
12 | 12b98134b8809 |
13 | 629b08182c91 |
14 | 2a6bbc9d32c1 |
15 | 1448e94a7a86 |
hex | a2022625589 |
11133132101001 has 10 divisors (see below), whose sum is σ = 16630975113962. Its totient is φ = 7422088067280.
The previous prime is 11133132100967. The next prime is 11133132101051. The reversal of 11133132101001 is 10010123133111.
11133132101001 is a `hidden beast` number, since 1 + 1 + 1 + 331 + 321 + 0 + 10 + 0 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 5814965707776 + 5318166393225 = 2411424^2 + 2306115^2 .
It is not a de Polignac number, because 11133132101001 - 211 = 11133132098953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11133132101051) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 68723037580 + ... + 68723037741.
Almost surely, 211133132101001 is an apocalyptic number.
It is an amenable number.
11133132101001 is a deficient number, since it is larger than the sum of its proper divisors (5497843012961).
11133132101001 is an equidigital number, since it uses as much as digits as its factorization.
11133132101001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137446075333 (or 137446075324 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 18.
Adding to 11133132101001 its reverse (10010123133111), we get a palindrome (21143255234112).
The spelling of 11133132101001 in words is "eleven trillion, one hundred thirty-three billion, one hundred thirty-two million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •