Base | Representation |
---|---|
bin | 10101000100100011… |
… | …11110010100000000 |
3 | 1002012101120100110022 |
4 | 22202101332110000 |
5 | 141132003232024 |
6 | 5110311153012 |
7 | 550223063453 |
oct | 124221762400 |
9 | 32171510408 |
10 | 11312555264 |
11 | 488570822a |
12 | 2238675768 |
13 | 10b39000aa |
14 | 7945d149a |
15 | 46322d35e |
hex | 2a247e500 |
11312555264 has 36 divisors (see below), whose sum is σ = 22644004320. Its totient is φ = 5640476160.
The previous prime is 11312555249. The next prime is 11312555311. The reversal of 11312555264 is 46255521311.
It is a hoax number, since the sum of its digits (35) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30359 + ... + 153449.
It is an arithmetic number, because the mean of its divisors is an integer number (629000120).
Almost surely, 211312555264 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11312555264, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11322002160).
11312555264 is an abundant number, since it is smaller than the sum of its proper divisors (11331449056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11312555264 is an equidigital number, since it uses as much as digits as its factorization.
11312555264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123466 (or 123452 counting only the distinct ones).
The product of its digits is 36000, while the sum is 35.
The spelling of 11312555264 in words is "eleven billion, three hundred twelve million, five hundred fifty-five thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •