Base | Representation |
---|---|
bin | 10101100011100011… |
… | …11111100000011000 |
3 | 1002212111220100101002 |
4 | 22301301333200120 |
5 | 142200041411000 |
6 | 5152201044132 |
7 | 556531352003 |
oct | 126161774030 |
9 | 32774810332 |
10 | 11572607000 |
11 | 49a9486a19 |
12 | 22ab786648 |
13 | 1125751a66 |
14 | 7bad6653a |
15 | 47ae9a8d5 |
hex | 2b1c7f818 |
11572607000 has 64 divisors (see below), whose sum is σ = 27406360800. Its totient is φ = 4573238400.
The previous prime is 11572606961. The next prime is 11572607041. The reversal of 11572607000 is 70627511.
11572607000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 15 ways as a sum of consecutive naturals, for example, 13286 + ... + 152714.
Almost surely, 211572607000 is an apocalyptic number.
11572607000 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 11572607000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13703180400).
11572607000 is an abundant number, since it is smaller than the sum of its proper divisors (15833753800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11572607000 is a wasteful number, since it uses less digits than its factorization.
11572607000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139533 (or 139519 counting only the distinct ones).
The product of its (nonzero) digits is 2940, while the sum is 29.
The spelling of 11572607000 in words is "eleven billion, five hundred seventy-two million, six hundred seven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •