Base | Representation |
---|---|
bin | 100001110101111… |
… | …0010001000011000 |
3 | 2221010201222010110 |
4 | 1003223302020120 |
5 | 4311200113000 |
6 | 304402444320 |
7 | 40066011213 |
oct | 10353621030 |
9 | 2833658113 |
10 | 1135551000 |
11 | 532a97301 |
12 | 2783636a0 |
13 | 15134a48c |
14 | aab5477a |
15 | 69a59850 |
hex | 43af2218 |
1135551000 has 128 divisors (see below), whose sum is σ = 3583569600. Its totient is φ = 299340800.
The previous prime is 1135550981. The next prime is 1135551007. The reversal of 1135551000 is 1555311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1135551007) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 264874 + ... + 269126.
Almost surely, 21135551000 is an apocalyptic number.
1135551000 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 1135551000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1791784800).
1135551000 is an abundant number, since it is smaller than the sum of its proper divisors (2448018600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1135551000 is a wasteful number, since it uses less digits than its factorization.
1135551000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4366 (or 4352 counting only the distinct ones).
The product of its (nonzero) digits is 375, while the sum is 21.
The square root of 1135551000 is about 33697.9376223531. The cubic root of 1135551000 is about 1043.2832016887.
The spelling of 1135551000 in words is "one billion, one hundred thirty-five million, five hundred fifty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •