Base | Representation |
---|---|
bin | 1010100000100101110100… |
… | …1110001000001000001000 |
3 | 1111220122112122000100121201 |
4 | 2220021131032020020020 |
5 | 3003304143124320012 |
6 | 40324150005113544 |
7 | 2301552213344656 |
oct | 250113516101010 |
9 | 44818478010551 |
10 | 11555026010632 |
11 | 3755505a42655 |
12 | 13675369b88b4 |
13 | 65a832679620 |
14 | 2bd3a27dbdd6 |
15 | 15088d025857 |
hex | a825d388208 |
11555026010632 has 32 divisors (see below), whose sum is σ = 23714760205080. Its totient is φ = 5245661237760.
The previous prime is 11555026010621. The next prime is 11555026010687. The reversal of 11555026010632 is 23601062055511.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 8712450242596 + 2842575768036 = 2951686^2 + 1685994^2 .
It is a super-2 number, since 2×115550260106322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11555026010591 and 11555026010600.
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, 910698733 + ... + 910711420.
Almost surely, 211555026010632 is an apocalyptic number.
It is an amenable number.
11555026010632 is an abundant number, since it is smaller than the sum of its proper divisors (12159734194448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11555026010632 is a wasteful number, since it uses less digits than its factorization.
11555026010632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1821410233 (or 1821410229 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 37.
The spelling of 11555026010632 in words is "eleven trillion, five hundred fifty-five billion, twenty-six million, ten thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •