Base | Representation |
---|---|
bin | 111011011110010000110000… |
… | …101011011011001110001001 |
3 | 1021022010022020112112010020010 |
4 | 323132100300223123032021 |
5 | 233240432214201011312 |
6 | 2324144554142022133 |
7 | 106044253544564031 |
oct | 7336206053331611 |
9 | 1238108215463203 |
10 | 261564325016457 |
11 | 7638489755a771 |
12 | 25404b03277949 |
13 | b2c4543a4bb88 |
14 | 4883ad0a368c1 |
15 | 2038d4d2b593c |
hex | ede430adb389 |
261564325016457 has 16 divisors (see below), whose sum is σ = 352223356052480. Its totient is φ = 172643222230272.
The previous prime is 261564325016453. The next prime is 261564325016503. The reversal of 261564325016457 is 754610523465162.
It is not a de Polignac number, because 261564325016457 - 22 = 261564325016453 is a prime.
It is a super-2 number, since 2×2615643250164572 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 261564325016397 and 261564325016406.
It is not an unprimeable number, because it can be changed into a prime (261564325016453) 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, 307937833 + ... + 308786070.
It is an arithmetic number, because the mean of its divisors is an integer number (22013959753280).
Almost surely, 2261564325016457 is an apocalyptic number.
It is an amenable number.
261564325016457 is a deficient number, since it is larger than the sum of its proper divisors (90659031036023).
261564325016457 is a wasteful number, since it uses less digits than its factorization.
261564325016457 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 616725312.
The product of its (nonzero) digits is 36288000, while the sum is 57.
The spelling of 261564325016457 in words is "two hundred sixty-one trillion, five hundred sixty-four billion, three hundred twenty-five million, sixteen thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •