Base | Representation |
---|---|
bin | 10011110000111111… |
… | …00001110011101010 |
3 | 1000101112100022000220 |
4 | 21320133201303222 |
5 | 133213013343300 |
6 | 4512544310510 |
7 | 523650653025 |
oct | 117037416352 |
9 | 30345308026 |
10 | 10611465450 |
11 | 4555994063 |
12 | 2081912436 |
13 | 100159b951 |
14 | 7294521bc |
15 | 4218e2da0 |
hex | 2787e1cea |
10611465450 has 96 divisors (see below), whose sum is σ = 28321669440. Its totient is φ = 2619571200.
The previous prime is 10611465419. The next prime is 10611465499. The reversal of 10611465450 is 5456411601.
It is a super-2 number, since 2×106114654502 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 121441 + ... + 189659.
It is an arithmetic number, because the mean of its divisors is an integer number (295017390).
Almost surely, 210611465450 is an apocalyptic number.
10611465450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 10611465450, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14160834720).
10611465450 is an abundant number, since it is smaller than the sum of its proper divisors (17710203990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10611465450 is a wasteful number, since it uses less digits than its factorization.
10611465450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68312 (or 68307 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 33.
The spelling of 10611465450 in words is "ten billion, six hundred eleven million, four hundred sixty-five thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •