Base | Representation |
---|---|
bin | 10011011110001001… |
… | …11100001001101001 |
3 | 222222112002211212222 |
4 | 21233010330021221 |
5 | 132402044004041 |
6 | 4445142443425 |
7 | 520022200622 |
oct | 115704741151 |
9 | 28875084788 |
10 | 10453500521 |
11 | 4484801732 |
12 | 2038a33575 |
13 | ca7941589 |
14 | 712492a49 |
15 | 412add74b |
hex | 26f13c269 |
10453500521 has 8 divisors (see below), whose sum is σ = 10630376904. Its totient is φ = 10276801920.
The previous prime is 10453500493. The next prime is 10453500523. The reversal of 10453500521 is 12500535401.
10453500521 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 172554496 + 10280946025 = 13136^2 + 101395^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10453500521 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10453500523) 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 7 ways as a sum of consecutive naturals, for example, 76925 + ... + 163781.
It is an arithmetic number, because the mean of its divisors is an integer number (1328797113).
Almost surely, 210453500521 is an apocalyptic number.
It is an amenable number.
10453500521 is a deficient number, since it is larger than the sum of its proper divisors (176876383).
10453500521 is an equidigital number, since it uses as much as digits as its factorization.
10453500521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88891.
The product of its (nonzero) digits is 3000, while the sum is 26.
The spelling of 10453500521 in words is "ten billion, four hundred fifty-three million, five hundred thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •