Base | Representation |
---|---|
bin | 10101011110000001… |
… | …00110110111110110 |
3 | 1002202021101212211120 |
4 | 22233000212313312 |
5 | 142101140402424 |
6 | 5143420244410 |
7 | 555425201241 |
oct | 125700466766 |
9 | 32667355746 |
10 | 11526106614 |
11 | 4985206550 |
12 | 22980a0706 |
13 | 1118c20539 |
14 | 7b4b00258 |
15 | 476d62a79 |
hex | 2af026df6 |
11526106614 has 64 divisors (see below), whose sum is σ = 25571572992. Its totient is φ = 3434112000.
The previous prime is 11526106589. The next prime is 11526106643. The reversal of 11526106614 is 41660162511.
It is a super-2 number, since 2×115261066142 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a Curzon number.
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 2655454 + ... + 2659790.
It is an arithmetic number, because the mean of its divisors is an integer number (399555828).
Almost surely, 211526106614 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11526106614, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12785786496).
11526106614 is an abundant number, since it is smaller than the sum of its proper divisors (14045466378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11526106614 is a wasteful number, since it uses less digits than its factorization.
11526106614 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5021.
The product of its (nonzero) digits is 8640, while the sum is 33.
The spelling of 11526106614 in words is "eleven billion, five hundred twenty-six million, one hundred six thousand, six hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •