Base | Representation |
---|---|
bin | 11101011011001010111… |
… | …11001110101101101111 |
3 | 10120122121201111102201022 |
4 | 32231211133032231233 |
5 | 113031032110000421 |
6 | 2052242311204355 |
7 | 133021006131152 |
oct | 16554537165557 |
9 | 3518551442638 |
10 | 1011020000111 |
11 | 35a853484100 |
12 | 143b386766bb |
13 | 744533a6674 |
14 | 36d0dc41c99 |
15 | 1b473e567ab |
hex | eb657ceb6f |
1011020000111 has 48 divisors (see below), whose sum is σ = 1136323974240. Its totient is φ = 898689792000.
The previous prime is 1011020000071. The next prime is 1011020000141. The reversal of 1011020000111 is 1110000201101.
It is a happy number.
It is not a de Polignac number, because 1011020000111 - 218 = 1011019737967 is a prime.
It is a super-2 number, since 2×10110200001112 (a number of 25 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 (1011020000141) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 432243380 + ... + 432245718.
It is an arithmetic number, because the mean of its divisors is an integer number (23673416130).
Almost surely, 21011020000111 is an apocalyptic number.
1011020000111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1011020000111 is a deficient number, since it is larger than the sum of its proper divisors (125303974129).
1011020000111 is a wasteful number, since it uses less digits than its factorization.
1011020000111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2888 (or 2877 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 1011020000111 its reverse (1110000201101), we get a palindrome (2121020201212).
The spelling of 1011020000111 in words is "one trillion, eleven billion, twenty million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •