Base | Representation |
---|---|
bin | 10000010100010000101… |
… | …000001001111011011101 |
3 | 10222012011220201100022100 |
4 | 100110100220021323131 |
5 | 121332322422114031 |
6 | 2215034025235313 |
7 | 144003000603330 |
oct | 20242050117335 |
9 | 3865156640270 |
10 | 1121265426141 |
11 | 3a2587113443 |
12 | 161385632b39 |
13 | 819726a4073 |
14 | 3c3ab870617 |
15 | 1e27787cde6 |
hex | 10510a09edd |
1121265426141 has 96 divisors (see below), whose sum is σ = 1965878553600. Its totient is φ = 601184954880.
The previous prime is 1121265426139. The next prime is 1121265426173. The reversal of 1121265426141 is 1416245621211.
1121265426141 is a `hidden beast` number, since 1 + 1 + 2 + 12 + 6 + 542 + 61 + 41 = 666.
It is not a de Polignac number, because 1121265426141 - 21 = 1121265426139 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1121265426096 and 1121265426105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121265426101) 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 95 ways as a sum of consecutive naturals, for example, 768515670 + ... + 768517128.
It is an arithmetic number, because the mean of its divisors is an integer number (20477901600).
Almost surely, 21121265426141 is an apocalyptic number.
It is an amenable number.
1121265426141 is a deficient number, since it is larger than the sum of its proper divisors (844613127459).
1121265426141 is a wasteful number, since it uses less digits than its factorization.
1121265426141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3199 (or 3196 counting only the distinct ones).
The product of its digits is 23040, while the sum is 36.
The spelling of 1121265426141 in words is "one trillion, one hundred twenty-one billion, two hundred sixty-five million, four hundred twenty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •