Base | Representation |
---|---|
bin | 10101101001011001… |
… | …00101001010110101 |
3 | 1002222220221101110122 |
4 | 22310230211022311 |
5 | 142300102120203 |
6 | 5201105301325 |
7 | 560664201443 |
oct | 126454451265 |
9 | 32886841418 |
10 | 11621520053 |
11 | 4a24055030 |
12 | 2304034845 |
13 | 11329194b0 |
14 | 7c3659b93 |
15 | 48040d538 |
hex | 2b4b252b5 |
11621520053 has 16 divisors (see below), whose sum is σ = 13806676800. Its totient is φ = 9642737280.
The previous prime is 11621520049. The next prime is 11621520061. The reversal of 11621520053 is 35002512611.
11621520053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11621520053 - 22 = 11621520049 is a prime.
It is a super-2 number, since 2×116215200532 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11621520083) 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 15 ways as a sum of consecutive naturals, for example, 443843 + ... + 469296.
It is an arithmetic number, because the mean of its divisors is an integer number (862917300).
Almost surely, 211621520053 is an apocalyptic number.
11621520053 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11621520053 is a deficient number, since it is larger than the sum of its proper divisors (2185156747).
11621520053 is a wasteful number, since it uses less digits than its factorization.
11621520053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 913252.
The product of its (nonzero) digits is 1800, while the sum is 26.
The spelling of 11621520053 in words is "eleven billion, six hundred twenty-one million, five hundred twenty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •