Base | Representation |
---|---|
bin | 1011001101110001000101… |
… | …1011000100001010000000 |
3 | 1121122211211120211111121011 |
4 | 2303130101123010022000 |
5 | 3104013140203230100 |
6 | 42120503222410304 |
7 | 2411616141415366 |
oct | 263342133041200 |
9 | 47584746744534 |
10 | 12331143414400 |
11 | 3a24676a92308 |
12 | 1471a36b90994 |
13 | 6b5a8b754c45 |
14 | 308b8ad69636 |
15 | 165b647b7bba |
hex | b37116c4280 |
12331143414400 has 96 divisors (see below), whose sum is σ = 30879062927100. Its totient is φ = 4864889364480.
The previous prime is 12331143414391. The next prime is 12331143414419. The reversal of 12331143414400 is 441434113321.
It can be written as a sum of positive squares in 6 ways, for example, as 4782409144384 + 7548734270016 = 2186872^2 + 2747496^2 .
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 26160115 + ... + 26627314.
Almost surely, 212331143414400 is an apocalyptic number.
12331143414400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12331143414400 is an abundant number, since it is smaller than the sum of its proper divisors (18547919512700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12331143414400 is an equidigital number, since it uses as much as digits as its factorization.
12331143414400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52787526 (or 52787509 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 12331143414400 its reverse (441434113321), we get a palindrome (12772577527721).
The spelling of 12331143414400 in words is "twelve trillion, three hundred thirty-one billion, one hundred forty-three million, four hundred fourteen thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •