Base | Representation |
---|---|
bin | 10000010011001011111… |
… | …000100100001010100001 |
3 | 10222002012112112022021101 |
4 | 100103023320210022201 |
5 | 121322442144200001 |
6 | 2214323345354401 |
7 | 143632264520416 |
oct | 20231370441241 |
9 | 3862175468241 |
10 | 1120112100001 |
11 | 3a2045096444 |
12 | 161103338a01 |
13 | 8181a77206b |
14 | 3c2dc61010d |
15 | 1e20b4b1a01 |
hex | 104cbe242a1 |
1120112100001 has 4 divisors (see below), whose sum is σ = 1168812626112. Its totient is φ = 1071411573892.
The previous prime is 1120112099927. The next prime is 1120112100053. The reversal of 1120112100001 is 1000012110211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1120112100001 - 211 = 1120112097953 is a prime.
It is a super-2 number, since 2×11201121000012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1120112107001) 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, 24350263021 + ... + 24350263066.
It is an arithmetic number, because the mean of its divisors is an integer number (292203156528).
Almost surely, 21120112100001 is an apocalyptic number.
It is an amenable number.
1120112100001 is a deficient number, since it is larger than the sum of its proper divisors (48700526111).
1120112100001 is an equidigital number, since it uses as much as digits as its factorization.
1120112100001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48700526110.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1120112100001 its reverse (1000012110211), we get a palindrome (2120124210212).
The spelling of 1120112100001 in words is "one trillion, one hundred twenty billion, one hundred twelve million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •