Base | Representation |
---|---|
bin | 1010100000100000001110… |
… | …1000100111001001111110 |
3 | 1111220111122212211201011112 |
4 | 2220020003220213021332 |
5 | 3003243103342112110 |
6 | 40323340514322022 |
7 | 2301500033115350 |
oct | 250100350471176 |
9 | 44814585751145 |
10 | 11553523004030 |
11 | 3754904599537 |
12 | 1367197589312 |
13 | 65a6531739c7 |
14 | 2bd29cd550d0 |
15 | 1508010d5405 |
hex | a8203a2727e |
11553523004030 has 32 divisors (see below), whose sum is σ = 23804913415680. Its totient is φ = 3954930204960.
The previous prime is 11553523003937. The next prime is 11553523004039. The reversal of 11553523004030 is 3040032535511.
It is a super-3 number, since 3×115535230040303 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11553523004039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 130740560 + ... + 130828899.
It is an arithmetic number, because the mean of its divisors is an integer number (743903544240).
Almost surely, 211553523004030 is an apocalyptic number.
11553523004030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11553523004030 is an abundant number, since it is smaller than the sum of its proper divisors (12251390411650).
11553523004030 is a wasteful number, since it uses less digits than its factorization.
11553523004030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 261570104.
The product of its (nonzero) digits is 27000, while the sum is 32.
Adding to 11553523004030 its reverse (3040032535511), we get a palindrome (14593555539541).
The spelling of 11553523004030 in words is "eleven trillion, five hundred fifty-three billion, five hundred twenty-three million, four thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •