Base | Representation |
---|---|
bin | 10000010011000111000… |
… | …000111010101001000101 |
3 | 10222001222211210200020202 |
4 | 100103013000322221011 |
5 | 121322310240400031 |
6 | 2214311310340245 |
7 | 143630253226226 |
oct | 20230700725105 |
9 | 3861884720222 |
10 | 1120030403141 |
11 | 3a2002a66381 |
12 | 16109baba685 |
13 | 81806869520 |
14 | 3c2d182524d |
15 | 1e2042252cb |
hex | 104c703aa45 |
1120030403141 has 4 divisors (see below), whose sum is σ = 1206186588012. Its totient is φ = 1033874218272.
The previous prime is 1120030403113. The next prime is 1120030403161. The reversal of 1120030403141 is 1413040300211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 463032616225 + 656997786916 = 680465^2 + 810554^2 .
It is a cyclic number.
It is not a de Polignac number, because 1120030403141 - 214 = 1120030386757 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120030403161) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43078092416 + ... + 43078092441.
It is an arithmetic number, because the mean of its divisors is an integer number (301546647003).
Almost surely, 21120030403141 is an apocalyptic number.
It is an amenable number.
1120030403141 is a deficient number, since it is larger than the sum of its proper divisors (86156184871).
1120030403141 is an equidigital number, since it uses as much as digits as its factorization.
1120030403141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86156184870.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 1120030403141 its reverse (1413040300211), we get a palindrome (2533070703352).
The spelling of 1120030403141 in words is "one trillion, one hundred twenty billion, thirty million, four hundred three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •