Base | Representation |
---|---|
bin | 1010000000110111110101… |
… | …0010001100100001011101 |
3 | 1102222120000000102102011002 |
4 | 2200031331102030201131 |
5 | 2420342142343222113 |
6 | 35225545504040045 |
7 | 2214311422135664 |
oct | 240157522144135 |
9 | 42876000372132 |
10 | 11010103101533 |
11 | 35653a41936a8 |
12 | 12999b9303025 |
13 | 61b32c59c943 |
14 | 2a0c6b295ddb |
15 | 1415e8630c58 |
hex | a037d48c85d |
11010103101533 has 8 divisors (see below), whose sum is σ = 11590538769600. Its totient is φ = 10429763089248.
The previous prime is 11010103101433. The next prime is 11010103101539. The reversal of 11010103101533 is 33510130101011.
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 11010103101533 - 210 = 11010103100509 is a prime.
It is a super-2 number, since 2×110101031015332 (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 (11010103101539) 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, 23677616 + ... + 24138137.
It is an arithmetic number, because the mean of its divisors is an integer number (1448817346200).
Almost surely, 211010103101533 is an apocalyptic number.
It is an amenable number.
11010103101533 is a deficient number, since it is larger than the sum of its proper divisors (580435668067).
11010103101533 is a wasteful number, since it uses less digits than its factorization.
11010103101533 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47827891.
The product of its (nonzero) digits is 135, while the sum is 20.
Adding to 11010103101533 its reverse (33510130101011), we get a palindrome (44520233202544).
The spelling of 11010103101533 in words is "eleven trillion, ten billion, one hundred three million, one hundred one thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •