Base | Representation |
---|---|
bin | 10000010100001010011… |
… | …100001001011011010101 |
3 | 10222011220200101012021112 |
4 | 100110022130021123111 |
5 | 121332114333140221 |
6 | 2215015440224405 |
7 | 144000300326165 |
oct | 20241234113325 |
9 | 3864820335245 |
10 | 1121161615061 |
11 | 3a2533559664 |
12 | 16135690b105 |
13 | 819570279a7 |
14 | 3c39bb6a5a5 |
15 | 1e26d6c415b |
hex | 1050a7096d5 |
1121161615061 has 8 divisors (see below), whose sum is σ = 1143005085144. Its totient is φ = 1099343681280.
The previous prime is 1121161615043. The next prime is 1121161615081. The reversal of 1121161615061 is 1605161611211.
It can be written as a sum of positive squares in 4 ways, for example, as 546999284836 + 574162330225 = 739594^2 + 757735^2 .
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 1121161615061 - 26 = 1121161614997 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 (1121161615031) 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 7 ways as a sum of consecutive naturals, for example, 6295400 + ... + 6471041.
It is an arithmetic number, because the mean of its divisors is an integer number (142875635643).
Almost surely, 21121161615061 is an apocalyptic number.
It is an amenable number.
1121161615061 is a deficient number, since it is larger than the sum of its proper divisors (21843470083).
1121161615061 is a wasteful number, since it uses less digits than its factorization.
1121161615061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12768151.
The product of its (nonzero) digits is 2160, while the sum is 32.
The spelling of 1121161615061 in words is "one trillion, one hundred twenty-one billion, one hundred sixty-one million, six hundred fifteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •