Base | Representation |
---|---|
bin | 10000010011000101010… |
… | …100100111001101100001 |
3 | 10222001220212101020221001 |
4 | 100103011110213031201 |
5 | 121322231003341001 |
6 | 2214304414032001 |
7 | 143626460011225 |
oct | 20230524471541 |
9 | 3861825336831 |
10 | 1120002012001 |
11 | 3a1a98a34724 |
12 | 1610924a8601 |
13 | 81800a08932 |
14 | 3c2cbb54785 |
15 | 1e2019b8001 |
hex | 104c5527361 |
1120002012001 has 4 divisors (see below), whose sum is σ = 1120009265604. Its totient is φ = 1119994758400.
The previous prime is 1120002011971. The next prime is 1120002012011. The reversal of 1120002012001 is 1002102000211.
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 419975283025 + 700026728976 = 648055^2 + 836676^2 .
It is a cyclic number.
It is not a de Polignac number, because 1120002012001 - 219 = 1120001487713 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1120002012011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3390040 + ... + 3705721.
It is an arithmetic number, because the mean of its divisors is an integer number (280002316401).
Almost surely, 21120002012001 is an apocalyptic number.
It is an amenable number.
1120002012001 is a deficient number, since it is larger than the sum of its proper divisors (7253603).
1120002012001 is an equidigital number, since it uses as much as digits as its factorization.
1120002012001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7253602.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1120002012001 its reverse (1002102000211), we get a palindrome (2122104012212).
The spelling of 1120002012001 in words is "one trillion, one hundred twenty billion, two million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •