Base | Representation |
---|---|
bin | 10000010011001101100… |
… | …011110110001001000001 |
3 | 10222002021111110002211110 |
4 | 100103031203312021001 |
5 | 121323021344114131 |
6 | 2214330232233533 |
7 | 143633055540660 |
oct | 20231543661101 |
9 | 3862244402743 |
10 | 1120140223041 |
11 | 3a2059a54724 |
12 | 16111083b8a9 |
13 | 8182353a908 |
14 | 3c302250dd7 |
15 | 1e20dbb9646 |
hex | 104cd8f6241 |
1120140223041 has 32 divisors (see below), whose sum is σ = 1767076466688. Its totient is φ = 617879698560.
The previous prime is 1120140222991. The next prime is 1120140223079. The reversal of 1120140223041 is 1403220410211.
It is not a de Polignac number, because 1120140223041 - 210 = 1120140222017 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 1120140222999 and 1120140223017.
It is not an unprimeable number, because it can be changed into a prime (1120140223141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7701195 + ... + 7845296.
It is an arithmetic number, because the mean of its divisors is an integer number (55221139584).
Almost surely, 21120140223041 is an apocalyptic number.
It is an amenable number.
1120140223041 is a deficient number, since it is larger than the sum of its proper divisors (646936243647).
1120140223041 is a wasteful number, since it uses less digits than its factorization.
1120140223041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15546621.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 1120140223041 its reverse (1403220410211), we get a palindrome (2523360633252).
The spelling of 1120140223041 in words is "one trillion, one hundred twenty billion, one hundred forty million, two hundred twenty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •