Base | Representation |
---|---|
bin | 10000010011000111001… |
… | …010111100101110101011 |
3 | 10222002000000202021220210 |
4 | 100103013022330232223 |
5 | 121322311424030011 |
6 | 2214311442552203 |
7 | 143630314461645 |
oct | 20230712745653 |
9 | 3862000667823 |
10 | 1120033033131 |
11 | 3a20044a2321 |
12 | 1610a0968663 |
13 | 8180727a62c |
14 | 3c2d1d0b895 |
15 | 1e2045946a6 |
hex | 104c72bcbab |
1120033033131 has 8 divisors (see below), whose sum is σ = 1558306828800. Its totient is φ = 714223963112.
The previous prime is 1120033033127. The next prime is 1120033033201. The reversal of 1120033033131 is 1313303300211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1120033033131 - 22 = 1120033033127 is a prime.
It is a super-2 number, since 2×11200330331312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1120033033098 and 1120033033107.
It is not an unprimeable number, because it can be changed into a prime (1120033033121) 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, 8116181331 + ... + 8116181468.
It is an arithmetic number, because the mean of its divisors is an integer number (194788353600).
Almost surely, 21120033033131 is an apocalyptic number.
1120033033131 is a deficient number, since it is larger than the sum of its proper divisors (438273795669).
1120033033131 is a wasteful number, since it uses less digits than its factorization.
1120033033131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16232362825.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 1120033033131 its reverse (1313303300211), we get a palindrome (2433336333342).
The spelling of 1120033033131 in words is "one trillion, one hundred twenty billion, thirty-three million, thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •