Base | Representation |
---|---|
bin | 1010011010010000011110… |
… | …0010101001001101011000 |
3 | 1111112020200100201002101220 |
4 | 2212210013202221031120 |
5 | 3000013321334203130 |
6 | 40202152430012040 |
7 | 2260650601543356 |
oct | 246440742511530 |
9 | 44466610632356 |
10 | 11446214366040 |
11 | 3713348675553 |
12 | 134a42a047020 |
13 | 6504b14278cc |
14 | 2b7ddd3967d6 |
15 | 14cb20418410 |
hex | a69078a9358 |
11446214366040 has 32 divisors (see below), whose sum is σ = 34338643098480. Its totient is φ = 3052323830912.
The previous prime is 11446214366039. The next prime is 11446214366047. The reversal of 11446214366040 is 4066341264411.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 11446214365983 and 11446214366001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11446214366047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47692559739 + ... + 47692559978.
Almost surely, 211446214366040 is an apocalyptic number.
11446214366040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11446214366040 is an abundant number, since it is smaller than the sum of its proper divisors (22892428732440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11446214366040 is a wasteful number, since it uses less digits than its factorization.
11446214366040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95385119731 (or 95385119727 counting only the distinct ones).
The product of its (nonzero) digits is 331776, while the sum is 42.
The spelling of 11446214366040 in words is "eleven trillion, four hundred forty-six billion, two hundred fourteen million, three hundred sixty-six thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •