Base | Representation |
---|---|
bin | 10101000100000001… |
… | …01001101110100100 |
3 | 1002012002000122200212 |
4 | 22202000221232210 |
5 | 141124322431000 |
6 | 5110025554552 |
7 | 550136352206 |
oct | 124200515644 |
9 | 32162018625 |
10 | 11308014500 |
11 | 4883096732 |
12 | 2237045a58 |
13 | 10b29a0353 |
14 | 793b6c776 |
15 | 462b32c35 |
hex | 2a2029ba4 |
11308014500 has 24 divisors (see below), whose sum is σ = 24696704760. Its totient is φ = 4523205600.
The previous prime is 11308014499. The next prime is 11308014503. The reversal of 11308014500 is 541080311.
It can be written as a sum of positive squares in 4 ways, for example, as 1270779904 + 10037234596 = 35648^2 + 100186^2 .
It is not an unprimeable number, because it can be changed into a prime (11308014503) 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 7 ways as a sum of consecutive naturals, for example, 11307515 + ... + 11308514.
It is an arithmetic number, because the mean of its divisors is an integer number (1029029365).
Almost surely, 211308014500 is an apocalyptic number.
11308014500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11308014500 is an abundant number, since it is smaller than the sum of its proper divisors (13388690260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11308014500 is a wasteful number, since it uses less digits than its factorization.
11308014500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22616048 (or 22616036 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 23.
Adding to 11308014500 its reverse (541080311), we get a palindrome (11849094811).
The spelling of 11308014500 in words is "eleven billion, three hundred eight million, fourteen thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •