Base | Representation |
---|---|
bin | 10000010011001011001… |
… | …010011010010011111101 |
3 | 10222002011200202121121000 |
4 | 100103023022122103331 |
5 | 121322431100013041 |
6 | 2214322234200513 |
7 | 143632056626421 |
oct | 20231312322375 |
9 | 3862150677530 |
10 | 1120100001021 |
11 | 3a2039282291 |
12 | 1610bb283139 |
13 | 818180c6cc1 |
14 | 3c2dab80b81 |
15 | 1e20a3c1bb6 |
hex | 104cb29a4fd |
1120100001021 has 16 divisors (see below), whose sum is σ = 1684174686400. Its totient is φ = 735588059184.
The previous prime is 1120100001017. The next prime is 1120100001029. The reversal of 1120100001021 is 1201000010211.
It is a happy number.
It is not a de Polignac number, because 1120100001021 - 22 = 1120100001017 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1120100000994 and 1120100001012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120100001029) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 309589126 + ... + 309592743.
It is an arithmetic number, because the mean of its divisors is an integer number (105260917900).
Almost surely, 21120100001021 is an apocalyptic number.
It is an amenable number.
1120100001021 is a deficient number, since it is larger than the sum of its proper divisors (564074685379).
1120100001021 is an equidigital number, since it uses as much as digits as its factorization.
1120100001021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 619181945 (or 619181939 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1120100001021 its reverse (1201000010211), we get a palindrome (2321100011232).
The spelling of 1120100001021 in words is "one trillion, one hundred twenty billion, one hundred million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •