Base | Representation |
---|---|
bin | 10001110000011100111… |
… | …111010001101110000001 |
3 | 11022122200210221110200011 |
4 | 101300130333101232001 |
5 | 124443041301434021 |
6 | 2332324531424521 |
7 | 154106051613103 |
oct | 21603477215601 |
9 | 4278623843604 |
10 | 1220257061761 |
11 | 430565332451 |
12 | 1785b1755141 |
13 | 8b0ba30839a |
14 | 430bca07573 |
15 | 21b1d2d2de1 |
hex | 11c1cfd1b81 |
1220257061761 has 8 divisors (see below), whose sum is σ = 1228100551400. Its totient is φ = 1212414473088.
The previous prime is 1220257061731. The next prime is 1220257061833. The reversal of 1220257061761 is 1671607520221.
It can be written as a sum of positive squares in 4 ways, for example, as 380991361 + 1219876070400 = 19519^2 + 1104480^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 1220257061761 - 225 = 1220223507329 is a prime.
It is a super-2 number, since 2×12202570617612 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1220257061731) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2606215 + ... + 3038563.
It is an arithmetic number, because the mean of its divisors is an integer number (153512568925).
Almost surely, 21220257061761 is an apocalyptic number.
It is an amenable number.
1220257061761 is a deficient number, since it is larger than the sum of its proper divisors (7843489639).
1220257061761 is a wasteful number, since it uses less digits than its factorization.
1220257061761 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 450483.
The product of its (nonzero) digits is 70560, while the sum is 40.
The spelling of 1220257061761 in words is "one trillion, two hundred twenty billion, two hundred fifty-seven million, sixty-one thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •