Base | Representation |
---|---|
bin | 10000010011010001010… |
… | …011101100111101101011 |
3 | 10222002102212202120211010 |
4 | 100103101103230331223 |
5 | 121323133443200021 |
6 | 2214340400035003 |
7 | 143634451146522 |
oct | 20232123547553 |
9 | 3862385676733 |
10 | 1120203100011 |
11 | 3a20914a0066 |
12 | 161129902a63 |
13 | 81833584218 |
14 | 3c30a73b4b9 |
15 | 1e214489976 |
hex | 104d14ecf6b |
1120203100011 has 8 divisors (see below), whose sum is σ = 1493625679504. Its totient is φ = 746791293600.
The previous prime is 1120203099979. The next prime is 1120203100033. The reversal of 1120203100011 is 1100013020211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1120203100011 - 25 = 1120203099979 is a prime.
It is a super-3 number, since 3×11202031000113 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1120203100011.
It is not an unprimeable number, because it can be changed into a prime (1120203107011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2447440 + ... + 2868861.
It is an arithmetic number, because the mean of its divisors is an integer number (186703209938).
Almost surely, 21120203100011 is an apocalyptic number.
1120203100011 is a deficient number, since it is larger than the sum of its proper divisors (373422579493).
1120203100011 is an equidigital number, since it uses as much as digits as its factorization.
1120203100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5386541.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 1120203100011 its reverse (1100013020211), we get a palindrome (2220216120222).
The spelling of 1120203100011 in words is "one trillion, one hundred twenty billion, two hundred three million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •