Base | Representation |
---|---|
bin | 11101011011010100110… |
… | …11111011100001001101 |
3 | 10120122211111201100010222 |
4 | 32231222123323201031 |
5 | 113031214333134013 |
6 | 2052254434441125 |
7 | 133023034606022 |
oct | 16555233734115 |
9 | 3518744640128 |
10 | 1011103021133 |
11 | 35a896329017 |
12 | 143b604331a5 |
13 | 74467653b2a |
14 | 36d1ac93549 |
15 | 1b47b3a5508 |
hex | eb6a6fb84d |
1011103021133 has 4 divisors (see below), whose sum is σ = 1011113585820. Its totient is φ = 1011092456448.
The previous prime is 1011103021087. The next prime is 1011103021147. The reversal of 1011103021133 is 3311203011101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 341321187529 + 669781833604 = 584227^2 + 818402^2 .
It is a cyclic number.
It is not a de Polignac number, because 1011103021133 - 226 = 1011035912269 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011103021333) 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, 5137460 + ... + 5330637.
It is an arithmetic number, because the mean of its divisors is an integer number (252778396455).
Almost surely, 21011103021133 is an apocalyptic number.
It is an amenable number.
1011103021133 is a deficient number, since it is larger than the sum of its proper divisors (10564687).
1011103021133 is an equidigital number, since it uses as much as digits as its factorization.
1011103021133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10564686.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 1011103021133 its reverse (3311203011101), we get a palindrome (4322306032234).
The spelling of 1011103021133 in words is "one trillion, eleven billion, one hundred three million, twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •