Base | Representation |
---|---|
bin | 1010011010100100010010… |
… | …0000011001100101011000 |
3 | 1111112202101222001202202212 |
4 | 2212221010200121211120 |
5 | 3000110214212431344 |
6 | 40204432232414252 |
7 | 2261226433161050 |
oct | 246510440314530 |
9 | 44482358052685 |
10 | 11451532155224 |
11 | 37156273a7247 |
12 | 134b472b47388 |
13 | 650b4b072325 |
14 | 2b838573c560 |
15 | 14cd321e479e |
hex | a6a44819958 |
11451532155224 has 32 divisors (see below), whose sum is σ = 25830523660800. Its totient is φ = 4649494258080.
The previous prime is 11451532155209. The next prime is 11451532155233. The reversal of 11451532155224 is 42255123515411.
It is a super-2 number, since 2×114515321552242 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 5381358032 + ... + 5381360159.
It is an arithmetic number, because the mean of its divisors is an integer number (807203864400).
Almost surely, 211451532155224 is an apocalyptic number.
11451532155224 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
11451532155224 is an abundant number, since it is smaller than the sum of its proper divisors (14378991505576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11451532155224 is a wasteful number, since it uses less digits than its factorization.
11451532155224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10762718223 (or 10762718219 counting only the distinct ones).
The product of its digits is 240000, while the sum is 41.
The spelling of 11451532155224 in words is "eleven trillion, four hundred fifty-one billion, five hundred thirty-two million, one hundred fifty-five thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •