Base | Representation |
---|---|
bin | 10000010011000101010… |
… | …000110000101001110101 |
3 | 10222001220210110221121100 |
4 | 100103011100300221311 |
5 | 121322230224031401 |
6 | 2214304340240313 |
7 | 143626445304012 |
oct | 20230520605165 |
9 | 3861823427540 |
10 | 1120001002101 |
11 | 3a1a984049a3 |
12 | 1610920a0099 |
13 | 81800744067 |
14 | 3c2cb970709 |
15 | 1e201868b86 |
hex | 104c5430a75 |
1120001002101 has 24 divisors (see below), whose sum is σ = 1628926111800. Its totient is φ = 741524400000.
The previous prime is 1120001002093. The next prime is 1120001002123. The reversal of 1120001002101 is 1012001000211.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 4598874225 + 1115402127876 = 67815^2 + 1056126^2 .
It is not a de Polignac number, because 1120001002101 - 23 = 1120001002093 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 (1120001006101) 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, 7788351 + ... + 7930851.
It is an arithmetic number, because the mean of its divisors is an integer number (67871921325).
Almost surely, 21120001002101 is an apocalyptic number.
It is an amenable number.
1120001002101 is a deficient number, since it is larger than the sum of its proper divisors (508925109699).
1120001002101 is a wasteful number, since it uses less digits than its factorization.
1120001002101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 148517 (or 148514 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1120001002101 its reverse (1012001000211), we get a palindrome (2132002002312).
The spelling of 1120001002101 in words is "one trillion, one hundred twenty billion, one million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •