Base | Representation |
---|---|
bin | 10000010011011001000… |
… | …011101110110100010101 |
3 | 10222002202221102211211202 |
4 | 100103121003232310111 |
5 | 121323420240143104 |
6 | 2214401323042245 |
7 | 143640620326640 |
oct | 20233103566425 |
9 | 3862687384752 |
10 | 1120333131029 |
11 | 3a2148933312 |
12 | 161165370385 |
13 | 818544b0b58 |
14 | 3c31db08a57 |
15 | 1e220ac251e |
hex | 104d90eed15 |
1120333131029 has 8 divisors (see below), whose sum is σ = 1280403625728. Its totient is φ = 960268362480.
The previous prime is 1120333130981. The next prime is 1120333131097. The reversal of 1120333131029 is 9201313330211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-1120333131029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1120333130992 and 1120333131010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120333131529) 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 7 ways as a sum of consecutive naturals, for example, 1003757 + ... + 1802274.
It is an arithmetic number, because the mean of its divisors is an integer number (160050453216).
Almost surely, 21120333131029 is an apocalyptic number.
It is an amenable number.
1120333131029 is a deficient number, since it is larger than the sum of its proper divisors (160070494699).
1120333131029 is an equidigital number, since it uses as much as digits as its factorization.
1120333131029 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2863075.
The product of its (nonzero) digits is 2916, while the sum is 29.
The spelling of 1120333131029 in words is "one trillion, one hundred twenty billion, three hundred thirty-three million, one hundred thirty-one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •