Base | Representation |
---|---|
bin | 11101011011010110000… |
… | …11001001011111111101 |
3 | 10120122212020001122212022 |
4 | 32231223003021133331 |
5 | 113031230001131023 |
6 | 2052255443045525 |
7 | 133023221155313 |
oct | 16555303113775 |
9 | 3518766048768 |
10 | 1011113302013 |
11 | 35a8a1110211 |
12 | 143b639708a5 |
13 | 744698134a9 |
14 | 36d1c3ac0b3 |
15 | 1b47c2367c8 |
hex | eb6b0c97fd |
1011113302013 has 4 divisors (see below), whose sum is σ = 1032626351040. Its totient is φ = 989600252988.
The previous prime is 1011113301977. The next prime is 1011113302019. The reversal of 1011113302013 is 3102033111101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1011113302013 - 224 = 1011096524797 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1011113301982 and 1011113302000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011113302019) 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, 10756524443 + ... + 10756524536.
It is an arithmetic number, because the mean of its divisors is an integer number (258156587760).
Almost surely, 21011113302013 is an apocalyptic number.
It is an amenable number.
1011113302013 is a deficient number, since it is larger than the sum of its proper divisors (21513049027).
1011113302013 is an equidigital number, since it uses as much as digits as its factorization.
1011113302013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21513049026.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 1011113302013 its reverse (3102033111101), we get a palindrome (4113146413114).
The spelling of 1011113302013 in words is "one trillion, eleven billion, one hundred thirteen million, three hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •