Base | Representation |
---|---|
bin | 10011100100011111… |
… | …00100000011100001 |
3 | 1000010020001110002002 |
4 | 21302033210003201 |
5 | 133004143221212 |
6 | 4454321133345 |
7 | 521235525416 |
oct | 116217440341 |
9 | 30106043062 |
10 | 10506617057 |
11 | 45017909a2 |
12 | 205278a255 |
13 | cb594b391 |
14 | 71955c10d |
15 | 4175d1ac2 |
hex | 2723e40e1 |
10506617057 has 4 divisors (see below), whose sum is σ = 10506896580. Its totient is φ = 10506337536.
The previous prime is 10506617039. The next prime is 10506617059. The reversal of 10506617057 is 75071660501.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2779503841 + 7727113216 = 52721^2 + 87904^2 .
It is a cyclic number.
It is not a de Polignac number, because 10506617057 - 218 = 10506354913 is a prime.
It is a super-2 number, since 2×105066170572 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10506617057.
It is not an unprimeable number, because it can be changed into a prime (10506617059) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 72632 + ... + 162137.
It is an arithmetic number, because the mean of its divisors is an integer number (2626724145).
Almost surely, 210506617057 is an apocalyptic number.
It is an amenable number.
10506617057 is a deficient number, since it is larger than the sum of its proper divisors (279523).
10506617057 is an equidigital number, since it uses as much as digits as its factorization.
10506617057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 279522.
The product of its (nonzero) digits is 44100, while the sum is 38.
The spelling of 10506617057 in words is "ten billion, five hundred six million, six hundred seventeen thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •