Base | Representation |
---|---|
bin | 10100001110101100… |
… | …11010010000000001 |
3 | 1001000220101102102201 |
4 | 22013112122100001 |
5 | 134220321432231 |
6 | 4553411113201 |
7 | 533065465615 |
oct | 120726322001 |
9 | 31026342381 |
10 | 10860733441 |
11 | 4673667868 |
12 | 21312a2801 |
13 | 10411160bc |
14 | 7505bb345 |
15 | 438730161 |
hex | 28759a401 |
10860733441 has 4 divisors (see below), whose sum is σ = 11499600132. Its totient is φ = 10221866752.
The previous prime is 10860733427. The next prime is 10860733459. The reversal of 10860733441 is 14433706801.
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 9520880625 + 1339852816 = 97575^2 + 36604^2 .
It is a cyclic number.
It is not a de Polignac number, because 10860733441 - 211 = 10860731393 is a prime.
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 10860733441.
It is not an unprimeable number, because it can be changed into a prime (10860739441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 319433320 + ... + 319433353.
It is an arithmetic number, because the mean of its divisors is an integer number (2874900033).
Almost surely, 210860733441 is an apocalyptic number.
It is an amenable number.
10860733441 is a deficient number, since it is larger than the sum of its proper divisors (638866691).
10860733441 is an equidigital number, since it uses as much as digits as its factorization.
10860733441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 638866690.
The product of its (nonzero) digits is 48384, while the sum is 37.
The spelling of 10860733441 in words is "ten billion, eight hundred sixty million, seven hundred thirty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •