Base | Representation |
---|---|
bin | 1010001001001100001110… |
… | …0000110010101000100000 |
3 | 1110111012212210211221102212 |
4 | 2202103003200302220200 |
5 | 2430212333401103121 |
6 | 35415342515301252 |
7 | 2230531054320242 |
oct | 242230340625040 |
9 | 43435783757385 |
10 | 11153015253536 |
11 | 360aa70396732 |
12 | 13016422aa828 |
13 | 62b9565988b0 |
14 | 2a7b47580092 |
15 | 1451aed4225b |
hex | a24c3832a20 |
11153015253536 has 48 divisors (see below), whose sum is σ = 23653908797400. Its totient is φ = 5145940789248.
The previous prime is 11153015253509. The next prime is 11153015253587. The reversal of 11153015253536 is 63535251035111.
It can be written as a sum of positive squares in 4 ways, for example, as 5830969267600 + 5322045985936 = 2414740^2 + 2306956^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11153015253493 and 11153015253502.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2842391 + ... + 5512278.
Almost surely, 211153015253536 is an apocalyptic number.
11153015253536 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
11153015253536 is an abundant number, since it is smaller than the sum of its proper divisors (12500893543864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11153015253536 is a wasteful number, since it uses less digits than its factorization.
11153015253536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8357901 (or 8357893 counting only the distinct ones).
The product of its (nonzero) digits is 202500, while the sum is 41.
Adding to 11153015253536 its reverse (63535251035111), we get a palindrome (74688266288647).
The spelling of 11153015253536 in words is "eleven trillion, one hundred fifty-three billion, fifteen million, two hundred fifty-three thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •