Base | Representation |
---|---|
bin | 111011011111101001111010… |
… | …100101010010101111011001 |
3 | 1021022110110100001212200021201 |
4 | 323133221322211102233121 |
5 | 233244014242334001403 |
6 | 2324300545222434201 |
7 | 106054213032340261 |
oct | 7337517245225731 |
9 | 1238413301780251 |
10 | 261660054203353 |
11 | 76411451152763 |
12 | 2541b57a892961 |
13 | b30058b7bac70 |
14 | 48885b27aa7a1 |
15 | 203b5a25d421d |
hex | edfa7a952bd9 |
261660054203353 has 8 divisors (see below), whose sum is σ = 281914624980296. Its totient is φ = 241423608326400.
The previous prime is 261660054203323. The next prime is 261660054203357. The reversal of 261660054203353 is 353302450066162.
It can be written as a sum of positive squares in 4 ways, for example, as 1549992630169 + 260110061573184 = 1244987^2 + 16127928^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-261660054203353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (261660054203357) 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, 4531195008 + ... + 4531252753.
It is an arithmetic number, because the mean of its divisors is an integer number (35239328122537).
Almost surely, 2261660054203353 is an apocalyptic number.
It is an amenable number.
261660054203353 is a deficient number, since it is larger than the sum of its proper divisors (20254570776943).
261660054203353 is a wasteful number, since it uses less digits than its factorization.
261660054203353 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9062449995.
The product of its (nonzero) digits is 2332800, while the sum is 46.
The spelling of 261660054203353 in words is "two hundred sixty-one trillion, six hundred sixty billion, fifty-four million, two hundred three thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •