Base | Representation |
---|---|
bin | 11101011011001000101… |
… | …10110010101110000001 |
3 | 10120122120101202200122121 |
4 | 32231210112302232001 |
5 | 113031012224323243 |
6 | 2052240352204241 |
7 | 133020355542424 |
oct | 16554426625601 |
9 | 3518511680577 |
10 | 1011001011073 |
11 | 35a843794389 |
12 | 143b32239681 |
13 | 7444c488451 |
14 | 36d0b4db9bb |
15 | 1b4724551ed |
hex | eb645b2b81 |
1011001011073 has 2 divisors, whose sum is σ = 1011001011074. Its totient is φ = 1011001011072.
The previous prime is 1011001011061. The next prime is 1011001011113. The reversal of 1011001011073 is 3701101001101.
1011001011073 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 549602787904 + 461398223169 = 741352^2 + 679263^2 .
It is a cyclic number.
It is not a de Polignac number, because 1011001011073 - 225 = 1010967456641 is a prime.
It is a super-2 number, since 2×10110010110732 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1011001011673) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505500505536 + 505500505537.
It is an arithmetic number, because the mean of its divisors is an integer number (505500505537).
Almost surely, 21011001011073 is an apocalyptic number.
It is an amenable number.
1011001011073 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011001011073 is an equidigital number, since it uses as much as digits as its factorization.
1011001011073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 21, while the sum is 16.
Adding to 1011001011073 its reverse (3701101001101), we get a palindrome (4712102012174).
The spelling of 1011001011073 in words is "one trillion, eleven billion, one million, eleven thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •