Base | Representation |
---|---|
bin | 10111101111001110010111… |
… | …011110000101101101100000 |
3 | 111200122120110012100211220010 |
4 | 113233032113132011231200 |
5 | 102140443314143424300 |
6 | 1010012501345244520 |
7 | 30663450016146252 |
oct | 2757162736055540 |
9 | 450576405324803 |
10 | 104400311311200 |
11 | 302a0a1802a923 |
12 | b861591033740 |
13 | 4633ba3c0b108 |
14 | 1bad0057cdcd2 |
15 | c10a59668a50 |
hex | 5ef397785b60 |
104400311311200 has 72 divisors (see below), whose sum is σ = 339823013325768. Its totient is φ = 27840083015680.
The previous prime is 104400311311181. The next prime is 104400311311207. The reversal of 104400311311200 is 2113113004401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104400311311207) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 21750062457 + ... + 21750067256.
It is an arithmetic number, because the mean of its divisors is an integer number (4719764073969).
Almost surely, 2104400311311200 is an apocalyptic number.
104400311311200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
104400311311200 is an abundant number, since it is smaller than the sum of its proper divisors (235422702014568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104400311311200 is a wasteful number, since it uses less digits than its factorization.
104400311311200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43500129736 (or 43500129723 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 104400311311200 its reverse (2113113004401), we get a palindrome (106513424315601).
The spelling of 104400311311200 in words is "one hundred four trillion, four hundred billion, three hundred eleven million, three hundred eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •