Base | Representation |
---|---|
bin | 1010000001110001111110… |
… | …1111110011010011110000 |
3 | 1110001001021221110122001120 |
4 | 2200130133233303103300 |
5 | 2421121130200022311 |
6 | 35241050512502240 |
7 | 2215403314615326 |
oct | 240343757632360 |
9 | 43031257418046 |
10 | 11025713673456 |
11 | 3570a84a24409 |
12 | 12a0a3524a980 |
13 | 61c949776551 |
14 | 2a190c615d16 |
15 | 141c0dd50706 |
hex | a071fbf34f0 |
11025713673456 has 80 divisors (see below), whose sum is σ = 28711334023680. Its totient is φ = 3645830522880.
The previous prime is 11025713673437. The next prime is 11025713673479. The reversal of 11025713673456 is 65437631752011.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 11025713673399 and 11025713673408.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7542016 + ... + 8884448.
It is an arithmetic number, because the mean of its divisors is an integer number (358891675296).
Almost surely, 211025713673456 is an apocalyptic number.
11025713673456 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
11025713673456 is an abundant number, since it is smaller than the sum of its proper divisors (17685620350224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11025713673456 is a wasteful number, since it uses less digits than its factorization.
11025713673456 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1343814 (or 1343808 counting only the distinct ones).
The product of its (nonzero) digits is 3175200, while the sum is 51.
The spelling of 11025713673456 in words is "eleven trillion, twenty-five billion, seven hundred thirteen million, six hundred seventy-three thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •