Base | Representation |
---|---|
bin | 10000010011010001000… |
… | …111111010100100011011 |
3 | 10222002102122221121010200 |
4 | 100103101013322210123 |
5 | 121323132200310021 |
6 | 2214340205513243 |
7 | 143634412660005 |
oct | 20232107724433 |
9 | 3862378847120 |
10 | 1120200010011 |
11 | 3a208a77a545 |
12 | 161128872823 |
13 | 81832a41914 |
14 | 3c30a175375 |
15 | 1e214079126 |
hex | 104d11fa91b |
1120200010011 has 24 divisors (see below), whose sum is σ = 1622063938560. Its totient is φ = 744956044416.
The previous prime is 1120200009947. The next prime is 1120200010067. The reversal of 1120200010011 is 1100100020211.
It is a happy number.
It is not a de Polignac number, because 1120200010011 - 26 = 1120200009947 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1120200009975 and 1120200010002.
It is not an unprimeable number, because it can be changed into a prime (1120200010411) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 15317350 + ... + 15390308.
It is an arithmetic number, because the mean of its divisors is an integer number (67585997440).
Almost surely, 21120200010011 is an apocalyptic number.
1120200010011 is a deficient number, since it is larger than the sum of its proper divisors (501863928549).
1120200010011 is a wasteful number, since it uses less digits than its factorization.
1120200010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77155 (or 77152 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1120200010011 its reverse (1100100020211), we get a palindrome (2220300030222).
The spelling of 1120200010011 in words is "one trillion, one hundred twenty billion, two hundred million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •