Base | Representation |
---|---|
bin | 1010100101000001101011… |
… | …0110011001010000010000 |
3 | 1112011221012212000210220021 |
4 | 2221100122312121100100 |
5 | 3011031220301420100 |
6 | 40423150511353224 |
7 | 2310220343635600 |
oct | 251203266312020 |
9 | 45157185023807 |
10 | 11631221904400 |
11 | 37848565a338a |
12 | 137a260822814 |
13 | 664a86639cb7 |
14 | 2c2d50256c00 |
15 | 15284c566a1a |
hex | a941ad99410 |
11631221904400 has 90 divisors (see below), whose sum is σ = 32506298129130. Its totient is φ = 3987847503360.
The previous prime is 11631221904373. The next prime is 11631221904409. The reversal of 11631221904400 is 440912213611.
It can be written as a sum of positive squares in 3 ways, for example, as 1545058944016 + 10086162960384 = 1243004^2 + 3175872^2 .
It is not an unprimeable number, because it can be changed into a prime (11631221904409) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 296695245 + ... + 296734444.
Almost surely, 211631221904400 is an apocalyptic number.
11631221904400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11631221904400 is an abundant number, since it is smaller than the sum of its proper divisors (20875076224730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11631221904400 is a wasteful number, since it uses less digits than its factorization.
11631221904400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 593429721 (or 593429703 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 34.
The spelling of 11631221904400 in words is "eleven trillion, six hundred thirty-one billion, two hundred twenty-one million, nine hundred four thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •