Base | Representation |
---|---|
bin | 1010010111110100011000… |
… | …0101111110010110101101 |
3 | 1111101020112021001011201220 |
4 | 2211331012011332112231 |
5 | 2443322013410022000 |
6 | 40131023010453553 |
7 | 2254635351531222 |
oct | 245750605762655 |
9 | 44336467034656 |
10 | 11404314142125 |
11 | 36a75a7029123 |
12 | 13422958942b9 |
13 | 6495647938c8 |
14 | 2b5d866a3949 |
15 | 14b9bbbcc1a0 |
hex | a5f4617e5ad |
11404314142125 has 32 divisors (see below), whose sum is σ = 18977368874880. Its totient is φ = 6082111728000.
The previous prime is 11404314142121. The next prime is 11404314142157. The reversal of 11404314142125 is 52124141340411.
It is not a de Polignac number, because 11404314142125 - 22 = 11404314142121 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11404314142121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12042921 + ... + 12955329.
It is an arithmetic number, because the mean of its divisors is an integer number (593042777340).
Almost surely, 211404314142125 is an apocalyptic number.
11404314142125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11404314142125 is a deficient number, since it is larger than the sum of its proper divisors (7573054732755).
11404314142125 is an equidigital number, since it uses as much as digits as its factorization.
11404314142125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 945758 (or 945748 counting only the distinct ones).
The product of its (nonzero) digits is 15360, while the sum is 33.
Adding to 11404314142125 its reverse (52124141340411), we get a palindrome (63528455482536).
The spelling of 11404314142125 in words is "eleven trillion, four hundred four billion, three hundred fourteen million, one hundred forty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •