Base | Representation |
---|---|
bin | 11101011011010101101… |
… | …11010100001100100101 |
3 | 10120122212000020001211200 |
4 | 32231222313110030211 |
5 | 113031223202400401 |
6 | 2052255252353113 |
7 | 133023152615661 |
oct | 16555267241445 |
9 | 3518760201750 |
10 | 1011110200101 |
11 | 35a89a391751 |
12 | 143b62915799 |
13 | 74468c98641 |
14 | 36d1bc018a1 |
15 | 1b47bd22686 |
hex | eb6add4325 |
1011110200101 has 24 divisors (see below), whose sum is σ = 1524224758680. Its totient is φ = 645069981696.
The previous prime is 1011110200007. The next prime is 1011110200117. The reversal of 1011110200101 is 1010020111101.
It can be written as a sum of positive squares in 4 ways, for example, as 3766767876 + 1007343432225 = 61374^2 + 1003665^2 .
It is not a de Polignac number, because 1011110200101 - 211 = 1011110198053 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011110204101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 17112036 + ... + 17171021.
It is an arithmetic number, because the mean of its divisors is an integer number (63509364945).
Almost surely, 21011110200101 is an apocalyptic number.
It is an amenable number.
1011110200101 is a deficient number, since it is larger than the sum of its proper divisors (513114558579).
1011110200101 is a wasteful number, since it uses less digits than its factorization.
1011110200101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34283205 (or 34283202 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1011110200101 its reverse (1010020111101), we get a palindrome (2021130311202).
The spelling of 1011110200101 in words is "one trillion, eleven billion, one hundred ten million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •