Base | Representation |
---|---|
bin | 11101000110110110011… |
… | …01101011111111001101 |
3 | 10112121110101210201120201 |
4 | 32203123031223333031 |
5 | 112341211203223041 |
6 | 2043235544413501 |
7 | 132153443346655 |
oct | 16433315537715 |
9 | 3477411721521 |
10 | 1000110211021 |
11 | 356165161089 |
12 | 1419b2a77291 |
13 | 73405075c6c |
14 | 36596d35365 |
15 | 1b036286631 |
hex | e8db36bfcd |
1000110211021 has 48 divisors (see below), whose sum is σ = 1100043106128. Its totient is φ = 905814835200.
The previous prime is 1000110210991. The next prime is 1000110211031. The reversal of 1000110211021 is 1201120110001.
It can be written as a sum of positive squares in 24 ways, for example, as 294182572996 + 705927638025 = 542386^2 + 840195^2 .
It is not a de Polignac number, because 1000110211021 - 25 = 1000110210989 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1000110210989 and 1000110211007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000110211031) 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, 757085041 + ... + 757086361.
It is an arithmetic number, because the mean of its divisors is an integer number (22917564711).
Almost surely, 21000110211021 is an apocalyptic number.
It is an amenable number.
1000110211021 is a deficient number, since it is larger than the sum of its proper divisors (99932895107).
1000110211021 is a wasteful number, since it uses less digits than its factorization.
1000110211021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1682 (or 1609 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1000110211021 its reverse (1201120110001), we get a palindrome (2201230321022).
The spelling of 1000110211021 in words is "one trillion, one hundred ten million, two hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •