Base | Representation |
---|---|
bin | 10101100101101100… |
… | …10110100110010100 |
3 | 1002220202121210111212 |
4 | 22302312112212110 |
5 | 142214133334010 |
6 | 5154041120552 |
7 | 560136600005 |
oct | 126266264624 |
9 | 32822553455 |
10 | 11590527380 |
11 | 4a08606853 |
12 | 22b5789158 |
13 | 1129387733 |
14 | 7bd4ad1ac |
15 | 47c83a505 |
hex | 2b2d96994 |
11590527380 has 24 divisors (see below), whose sum is σ = 25125273600. Its totient is φ = 4486655520.
The previous prime is 11590527329. The next prime is 11590527391. The reversal of 11590527380 is 8372509511.
11590527380 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×115905273803 (a number of 31 digits) contains 333 as substring.
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 7 ways as a sum of consecutive naturals, for example, 9346580 + ... + 9347819.
It is an arithmetic number, because the mean of its divisors is an integer number (1046886400).
Almost surely, 211590527380 is an apocalyptic number.
11590527380 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11590527380 is an abundant number, since it is smaller than the sum of its proper divisors (13534746220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11590527380 is a wasteful number, since it uses less digits than its factorization.
11590527380 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18694439 (or 18694437 counting only the distinct ones).
The product of its (nonzero) digits is 75600, while the sum is 41.
The spelling of 11590527380 in words is "eleven billion, five hundred ninety million, five hundred twenty-seven thousand, three hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •