Base | Representation |
---|---|
bin | 10101001110110111… |
… | …10101011101101100 |
3 | 1002102102021112202011 |
4 | 22213123311131230 |
5 | 141321122322130 |
6 | 5123040411004 |
7 | 552323061346 |
oct | 124733653554 |
9 | 32372245664 |
10 | 11399026540 |
11 | 491a4a93a0 |
12 | 2261616a64 |
13 | 10c87b7b25 |
14 | 7a1ca0296 |
15 | 46ab0e52a |
hex | 2a76f576c |
11399026540 has 48 divisors (see below), whose sum is σ = 26167567104. Its totient is φ = 4136619200.
The previous prime is 11399026531. The next prime is 11399026547. The reversal of 11399026540 is 4562099311.
It is a junction number, because it is equal to n+sod(n) for n = 11399026493 and 11399026502.
It is not an unprimeable number, because it can be changed into a prime (11399026547) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 55257 + ... + 160783.
It is an arithmetic number, because the mean of its divisors is an integer number (545157648).
Almost surely, 211399026540 is an apocalyptic number.
11399026540 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 11399026540, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13083783552).
11399026540 is an abundant number, since it is smaller than the sum of its proper divisors (14768540564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11399026540 is a wasteful number, since it uses less digits than its factorization.
11399026540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106038 (or 106036 counting only the distinct ones).
The product of its (nonzero) digits is 58320, while the sum is 40.
The spelling of 11399026540 in words is "eleven billion, three hundred ninety-nine million, twenty-six thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •