Base | Representation |
---|---|
bin | 1001100111101000011100… |
… | …0010011111100011101001 |
3 | 1101110002201201202120001110 |
4 | 2121322013002133203221 |
5 | 2341241110103413312 |
6 | 34254433210140533 |
7 | 2141060624454615 |
oct | 231720702374351 |
9 | 41402651676043 |
10 | 10576475060457 |
11 | 3408504497319 |
12 | 1229960121749 |
13 | 5b948504bc57 |
14 | 287c92cba345 |
15 | 1351b985d43c |
hex | 99e8709f8e9 |
10576475060457 has 32 divisors (see below), whose sum is σ = 14731633762560. Its totient is φ = 6736842731520.
The previous prime is 10576475060423. The next prime is 10576475060467. The reversal of 10576475060457 is 75406057467501.
It is not a de Polignac number, because 10576475060457 - 222 = 10576470866153 is a prime.
It is a super-2 number, since 2×105764750604572 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10576475060397 and 10576475060406.
It is not an unprimeable number, because it can be changed into a prime (10576475060467) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 273918769 + ... + 273957377.
It is an arithmetic number, because the mean of its divisors is an integer number (460363555080).
Almost surely, 210576475060457 is an apocalyptic number.
It is an amenable number.
10576475060457 is a deficient number, since it is larger than the sum of its proper divisors (4155158702103).
10576475060457 is a wasteful number, since it uses less digits than its factorization.
10576475060457 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42993.
The product of its (nonzero) digits is 24696000, while the sum is 57.
The spelling of 10576475060457 in words is "ten trillion, five hundred seventy-six billion, four hundred seventy-five million, sixty thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •