Base | Representation |
---|---|
bin | 101000100110110000000… |
… | …101101011110101010100 |
3 | 100212202110221102012201211 |
4 | 220212300011223311110 |
5 | 331204203320233010 |
6 | 5533515300031204 |
7 | 405412263060652 |
oct | 50466005536524 |
9 | 10782427365654 |
10 | 2790388055380 |
11 | 9864403482a2 |
12 | 390967392504 |
13 | 173195042143 |
14 | 990ac427dd2 |
15 | 4c8b751608a |
hex | 289b016bd54 |
2790388055380 has 12 divisors (see below), whose sum is σ = 5859814916340. Its totient is φ = 1116155222144.
The previous prime is 2790388055369. The next prime is 2790388055401. The reversal of 2790388055380 is 835508830972.
It can be written as a sum of positive squares in 2 ways, for example, as 409656321936 + 2380731733444 = 640044^2 + 1542962^2 .
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 69759701365 + ... + 69759701404.
It is an arithmetic number, because the mean of its divisors is an integer number (488317909695).
Almost surely, 22790388055380 is an apocalyptic number.
2790388055380 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2790388055380 is an abundant number, since it is smaller than the sum of its proper divisors (3069426860960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2790388055380 is a wasteful number, since it uses less digits than its factorization.
2790388055380 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139519402778 (or 139519402776 counting only the distinct ones).
The product of its (nonzero) digits is 14515200, while the sum is 58.
The spelling of 2790388055380 in words is "two trillion, seven hundred ninety billion, three hundred eighty-eight million, fifty-five thousand, three hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •