Base | Representation |
---|---|
bin | 10101000110000100… |
… | …11111101000001000 |
3 | 1002020021111120011000 |
4 | 22203002133220020 |
5 | 141143232242012 |
6 | 5111443535000 |
7 | 550436150250 |
oct | 124302375010 |
9 | 32207446130 |
10 | 11325274632 |
11 | 4891905501 |
12 | 224098a460 |
13 | 10b6434649 |
14 | 796182960 |
15 | 4643e1ddc |
hex | 2a309fa08 |
11325274632 has 128 divisors (see below), whose sum is σ = 36309715200. Its totient is φ = 3203712000.
The previous prime is 11325274607. The next prime is 11325274661. The reversal of 11325274632 is 23647252311.
11325274632 is a `hidden beast` number, since 1 + 1 + 325 + 274 + 63 + 2 = 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 polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 115632 + ... + 189792.
It is an arithmetic number, because the mean of its divisors is an integer number (283669650).
Almost surely, 211325274632 is an apocalyptic number.
11325274632 is a gapful number since it is divisible by the number (12) 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 11325274632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18154857600).
11325274632 is an abundant number, since it is smaller than the sum of its proper divisors (24984440568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11325274632 is a wasteful number, since it uses less digits than its factorization.
11325274632 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 74284 (or 74274 counting only the distinct ones).
The product of its digits is 60480, while the sum is 36.
The spelling of 11325274632 in words is "eleven billion, three hundred twenty-five million, two hundred seventy-four thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •