Base | Representation |
---|---|
bin | 1010000011100110000000… |
… | …0000101101110101110100 |
3 | 1110011000200100102020220010 |
4 | 2200321200000231311310 |
5 | 2422123420243323104 |
6 | 35303241054140220 |
7 | 2220555133401120 |
oct | 240714000556564 |
9 | 43130610366803 |
10 | 11056856620404 |
11 | 35832063463a1 |
12 | 12a6a86ab1670 |
13 | 6228708782ca |
14 | 2a322477c580 |
15 | 142932e95489 |
hex | a0e6002dd74 |
11056856620404 has 48 divisors (see below), whose sum is σ = 31219359873408. Its totient is φ = 2973272368128.
The previous prime is 11056856620399. The next prime is 11056856620409. The reversal of 11056856620404 is 40402665865011.
It is an interprime number because it is at equal distance from previous prime (11056856620399) and next prime (11056856620409).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11056856620409) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3871446969 + ... + 3871449824.
It is an arithmetic number, because the mean of its divisors is an integer number (650403330696).
Almost surely, 211056856620404 is an apocalyptic number.
11056856620404 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
11056856620404 is an abundant number, since it is smaller than the sum of its proper divisors (20162503253004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11056856620404 is a wasteful number, since it uses less digits than its factorization.
11056856620404 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7742896824 (or 7742896822 counting only the distinct ones).
The product of its (nonzero) digits is 1382400, while the sum is 48.
The spelling of 11056856620404 in words is "eleven trillion, fifty-six billion, eight hundred fifty-six million, six hundred twenty thousand, four hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •