Base | Representation |
---|---|
bin | 10000010011000101001… |
… | …101010100101011101110 |
3 | 10222001220201210011200000 |
4 | 100103011031110223232 |
5 | 121322230011213402 |
6 | 2214304305045130 |
7 | 143626434532131 |
oct | 20230515245356 |
9 | 3861821704600 |
10 | 1120000101102 |
11 | 3a1a97949a73 |
12 | 1610919267a6 |
13 | 818004b9c1c |
14 | 3c2cb7b8218 |
15 | 1e20173bc1c |
hex | 104c5354aee |
1120000101102 has 24 divisors (see below), whose sum is σ = 2516543438136. Its totient is φ = 373333366872.
The previous prime is 1120000101091. The next prime is 1120000101131. The reversal of 1120000101102 is 2011010000211.
It is a happy number.
It is a super-2 number, since 2×11200001011022 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1152262993 + ... + 1152263964.
It is an arithmetic number, because the mean of its divisors is an integer number (104855976589).
Almost surely, 21120000101102 is an apocalyptic number.
1120000101102 is an abundant number, since it is smaller than the sum of its proper divisors (1396543337034).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1120000101102 is an equidigital number, since it uses as much as digits as its factorization.
1120000101102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2304526974 (or 2304526962 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1120000101102 its reverse (2011010000211), we get a palindrome (3131010101313).
The spelling of 1120000101102 in words is "one trillion, one hundred twenty billion, one hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •