Base | Representation |
---|---|
bin | 1100000111000101111101… |
… | …10100111100001110010000 |
3 | 10111021222211210012210011011 |
4 | 12003202332310330032100 |
5 | 11442314313142100100 |
6 | 132350323224300304 |
7 | 5416045520406532 |
oct | 603427664741620 |
9 | 114258753183134 |
10 | 26631998784400 |
11 | 8538627023349 |
12 | 2ba1562611694 |
13 | 11b25047a6089 |
14 | 680dd1d99852 |
15 | 312b5ced7bba |
hex | 1838bed3c390 |
26631998784400 has 45 divisors (see below), whose sum is σ = 63983625048273. Its totient is φ = 10652758228800.
The previous prime is 26631998784301. The next prime is 26631998784437. The reversal of 26631998784400 is 448789913662.
The square root of 26631998784400 is 5160620.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 9587519562384 + 17044479222016 = 3096372^2 + 4128496^2 .
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 103083385 + ... + 103341415.
Almost surely, 226631998784400 is an apocalyptic number.
26631998784400 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
26631998784400 is the 5160620-th square number.
It is an amenable number.
26631998784400 is an abundant number, since it is smaller than the sum of its proper divisors (37351626263873).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26631998784400 is an frugal number, since it uses more digits than its factorization.
26631998784400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 516080 (or 258038 counting only the distinct ones).
The product of its (nonzero) digits is 125411328, while the sum is 67.
The spelling of 26631998784400 in words is "twenty-six trillion, six hundred thirty-one billion, nine hundred ninety-eight million, seven hundred eighty-four thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •