Base | Representation |
---|---|
bin | 10100111101001001… |
… | …01010010010101100 |
3 | 1002001001111202012100 |
4 | 22132210222102230 |
5 | 141020042021012 |
6 | 5100205535100 |
7 | 545536233015 |
oct | 123644522254 |
9 | 32031452170 |
10 | 11250345132 |
11 | 48535878a4 |
12 | 221b874490 |
13 | 10a3a5b170 |
14 | 78a23a00c |
15 | 45ca408dc |
hex | 29e92a4ac |
11250345132 has 144 divisors (see below), whose sum is σ = 32302117120. Its totient is φ = 3272918400.
The previous prime is 11250345109. The next prime is 11250345137. The reversal of 11250345132 is 23154305211.
11250345132 is a `hidden beast` number, since 112 + 5 + 0 + 34 + 513 + 2 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 11250345096 and 11250345105.
It is not an unprimeable number, because it can be changed into a prime (11250345137) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6143457 + ... + 6145287.
Almost surely, 211250345132 is an apocalyptic number.
11250345132 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 11250345132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16151058560).
11250345132 is an abundant number, since it is smaller than the sum of its proper divisors (21051771988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11250345132 is a wasteful number, since it uses less digits than its factorization.
11250345132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2564 (or 2559 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The spelling of 11250345132 in words is "eleven billion, two hundred fifty million, three hundred forty-five thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •