Base | Representation |
---|---|
bin | 1001000111101100000110… |
… | …10000001001101011010100 |
3 | 2122000021111121112022121111 |
4 | 10203312003100021223110 |
5 | 10112041432003314020 |
6 | 110353154153424404 |
7 | 4136645421200332 |
oct | 443660320115324 |
9 | 78007447468544 |
10 | 20055404354260 |
11 | 64324a3a07470 |
12 | 22baa5640b104 |
13 | b262a78b9802 |
14 | 4d4988628b52 |
15 | 24ba48e05d5a |
hex | 123d83409ad4 |
20055404354260 has 24 divisors (see below), whose sum is σ = 45945108157536. Its totient is φ = 7292874310560.
The previous prime is 20055404354239. The next prime is 20055404354261. The reversal of 20055404354260 is 6245340455002.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20055404354261) 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 7 ways as a sum of consecutive naturals, for example, 45580464222 + ... + 45580464661.
It is an arithmetic number, because the mean of its divisors is an integer number (1914379506564).
Almost surely, 220055404354260 is an apocalyptic number.
20055404354260 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20055404354260 is an abundant number, since it is smaller than the sum of its proper divisors (25889703803276).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20055404354260 is a wasteful number, since it uses less digits than its factorization.
20055404354260 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91160928903 (or 91160928901 counting only the distinct ones).
The product of its (nonzero) digits is 576000, while the sum is 40.
The spelling of 20055404354260 in words is "twenty trillion, fifty-five billion, four hundred four million, three hundred fifty-four thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •