Base | Representation |
---|---|
bin | 11101011011001010111… |
… | …11010001001000011011 |
3 | 10120122121201111221021222 |
4 | 32231211133101020123 |
5 | 113031032110310021 |
6 | 2052242311322255 |
7 | 133021006202054 |
oct | 16554537211033 |
9 | 3518551457258 |
10 | 1011020010011 |
11 | 35a853490590 |
12 | 143b3868038b |
13 | 744533ab01b |
14 | 36d0dc4572b |
15 | 1b473e596ab |
hex | eb657d121b |
1011020010011 has 8 divisors (see below), whose sum is σ = 1102979553024. Its totient is φ = 919068572520.
The previous prime is 1011020010001. The next prime is 1011020010017. The reversal of 1011020010011 is 1100100201101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1011020010011 is a prime.
It is a super-2 number, since 2×10110200100112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1011020010017) 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, 1764095 + ... + 2265848.
It is an arithmetic number, because the mean of its divisors is an integer number (137872444128).
Almost surely, 21011020010011 is an apocalyptic number.
1011020010011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1011020010011 is a deficient number, since it is larger than the sum of its proper divisors (91959543013).
1011020010011 is a wasteful number, since it uses less digits than its factorization.
1011020010011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4052761.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 1011020010011 its reverse (1100100201101), we get a palindrome (2111120211112).
The spelling of 1011020010011 in words is "one trillion, eleven billion, twenty million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •