Base | Representation |
---|---|
bin | 10011011001001001… |
… | …10101100100111001 |
3 | 222212121010112220201 |
4 | 21230210311210321 |
5 | 132310322434203 |
6 | 4441043122201 |
7 | 516002356324 |
oct | 115444654471 |
9 | 28777115821 |
10 | 10411530553 |
11 | 4463046006 |
12 | 2026973361 |
13 | c9c038188 |
14 | 70aa897bb |
15 | 40e09ce1d |
hex | 26c935939 |
10411530553 has 4 divisors (see below), whose sum is σ = 10411886628. Its totient is φ = 10411174480.
The previous prime is 10411530539. The next prime is 10411530583. The reversal of 10411530553 is 35503511401.
10411530553 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 8129366569 + 2282163984 = 90163^2 + 47772^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10411530553 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10411530523) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 129826 + ... + 194107.
It is an arithmetic number, because the mean of its divisors is an integer number (2602971657).
Almost surely, 210411530553 is an apocalyptic number.
It is an amenable number.
10411530553 is a deficient number, since it is larger than the sum of its proper divisors (356075).
10411530553 is an equidigital number, since it uses as much as digits as its factorization.
10411530553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 356074.
The product of its (nonzero) digits is 4500, while the sum is 28.
The spelling of 10411530553 in words is "ten billion, four hundred eleven million, five hundred thirty thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •