Base | Representation |
---|---|
bin | 10000010011000101010… |
… | …000110101000001110101 |
3 | 10222001220210111212012001 |
4 | 100103011100311001311 |
5 | 121322230230120041 |
6 | 2214304340455301 |
7 | 143626445410162 |
oct | 20230520650165 |
9 | 3861823455161 |
10 | 1120001020021 |
11 | 3a1a98417404 |
12 | 1610920aa531 |
13 | 8180074c270 |
14 | 3c2cb977069 |
15 | 1e20186e131 |
hex | 104c5435075 |
1120001020021 has 4 divisors (see below), whose sum is σ = 1206154944652. Its totient is φ = 1033847095392.
The previous prime is 1120001019967. The next prime is 1120001020037. The reversal of 1120001020021 is 1200201000211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 212992403121 + 907008616900 = 461511^2 + 952370^2 .
It is a cyclic number.
It is not a de Polignac number, because 1120001020021 - 229 = 1119464149109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120001020051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43076962296 + ... + 43076962321.
It is an arithmetic number, because the mean of its divisors is an integer number (301538736163).
Almost surely, 21120001020021 is an apocalyptic number.
It is an amenable number.
1120001020021 is a deficient number, since it is larger than the sum of its proper divisors (86153924631).
1120001020021 is an equidigital number, since it uses as much as digits as its factorization.
1120001020021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86153924630.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1120001020021 its reverse (1200201000211), we get a palindrome (2320202020232).
The spelling of 1120001020021 in words is "one trillion, one hundred twenty billion, one million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •