Base | Representation |
---|---|
bin | 10101001001011010… |
… | …01010010000000000 |
3 | 1002022020010011121000 |
4 | 22210231022100000 |
5 | 141222412031410 |
6 | 5114323132000 |
7 | 551225626545 |
oct | 124455122000 |
9 | 32266104530 |
10 | 11353236480 |
11 | 48a6673673 |
12 | 224a214000 |
13 | 10bc174a11 |
14 | 799b80bcc |
15 | 466ab6dc0 |
hex | 2a4b4a400 |
11353236480 has 352 divisors, whose sum is σ = 42729569280. Its totient is φ = 2848849920.
The previous prime is 11353236457. The next prime is 11353236511. The reversal of 11353236480 is 8463235311.
11353236480 is a `hidden beast` number, since 1 + 1 + 3 + 5 + 3 + 2 + 3 + 648 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2347665 + ... + 2352495.
Almost surely, 211353236480 is an apocalyptic number.
11353236480 is a gapful number since it is divisible by the number (10) 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 11353236480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21364784640).
11353236480 is an abundant number, since it is smaller than the sum of its proper divisors (31376332800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11353236480 is a wasteful number, since it uses less digits than its factorization.
11353236480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4882 (or 4858 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
The spelling of 11353236480 in words is "eleven billion, three hundred fifty-three million, two hundred thirty-six thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •