Base | Representation |
---|---|
bin | 1010011010001110011010… |
… | …1100101100100110110000 |
3 | 1111112012020221212201222022 |
4 | 2212203212230230212300 |
5 | 3000011204304301024 |
6 | 40202022023531012 |
7 | 2260631131163210 |
oct | 246434654544660 |
9 | 44465227781868 |
10 | 11445663353264 |
11 | 3713095636498 |
12 | 134a2b55b9a68 |
13 | 65042422144a |
14 | 2b7d8a122240 |
15 | 14cadbd7535e |
hex | a68e6b2c9b0 |
11445663353264 has 80 divisors (see below), whose sum is σ = 25508309560128. Its totient is φ = 4873483570176.
The previous prime is 11445663353261. The next prime is 11445663353281. The reversal of 11445663353264 is 46235336654411.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (11445663353261) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 178146554 + ... + 178210790.
Almost surely, 211445663353264 is an apocalyptic number.
11445663353264 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11445663353264, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12754154780064).
11445663353264 is an abundant number, since it is smaller than the sum of its proper divisors (14062646206864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11445663353264 is a wasteful number, since it uses less digits than its factorization.
11445663353264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74542 (or 74536 counting only the distinct ones).
The product of its digits is 18662400, while the sum is 53.
The spelling of 11445663353264 in words is "eleven trillion, four hundred forty-five billion, six hundred sixty-three million, three hundred fifty-three thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •