Base | Representation |
---|---|
bin | 1001011000011100111100111… |
… | …0011011001000010110101001 |
3 | 10012120120220212001210101120212 |
4 | 2112013033032123020112221 |
5 | 1143013242012421420431 |
6 | 10300045410235030505 |
7 | 256030122345261614 |
oct | 22607171633102651 |
9 | 3176526761711525 |
10 | 660204361123241 |
11 | 1813a81083a8730 |
12 | 6206804089b435 |
13 | 22450009077a7c |
14 | b9060c0d6117b |
15 | 514d66ceee72b |
hex | 25873ce6c85a9 |
660204361123241 has 16 divisors (see below), whose sum is σ = 721136516800128. Its totient is φ = 599424758956800.
The previous prime is 660204361123217. The next prime is 660204361123247. The reversal of 660204361123241 is 142321163402066.
660204361123241 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 660204361123241 - 210 = 660204361122217 is a prime.
It is a super-2 number, since 2×6602043611232412 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (660204361123247) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 38189231 + ... + 52714571.
It is an arithmetic number, because the mean of its divisors is an integer number (45071032300008).
Almost surely, 2660204361123241 is an apocalyptic number.
It is an amenable number.
660204361123241 is a deficient number, since it is larger than the sum of its proper divisors (60932155676887).
660204361123241 is a wasteful number, since it uses less digits than its factorization.
660204361123241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14530592.
The product of its (nonzero) digits is 248832, while the sum is 41.
The spelling of 660204361123241 in words is "six hundred sixty trillion, two hundred four billion, three hundred sixty-one million, one hundred twenty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •