Base | Representation |
---|---|
bin | 10100100010111001… |
… | …00100100000110100 |
3 | 1001110201010011210111 |
4 | 22101130210200310 |
5 | 140042202324000 |
6 | 5022301432404 |
7 | 540223322500 |
oct | 122134444064 |
9 | 31421104714 |
10 | 11030120500 |
11 | 4750240873 |
12 | 2179b6b704 |
13 | 106a242429 |
14 | 768cb1300 |
15 | 44853dcba |
hex | 291724834 |
11030120500 has 72 divisors (see below), whose sum is σ = 28022871240. Its totient is φ = 3781747200.
The previous prime is 11030120477. The next prime is 11030120501. The reversal of 11030120500 is 502103011.
It can be written as a sum of positive squares in 4 ways, for example, as 1852097296 + 9178023204 = 43036^2 + 95802^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11030120501) 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 23 ways as a sum of consecutive naturals, for example, 200605 + ... + 249604.
It is an arithmetic number, because the mean of its divisors is an integer number (389206545).
Almost surely, 211030120500 is an apocalyptic number.
11030120500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11030120500 is an abundant number, since it is smaller than the sum of its proper divisors (16992750740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11030120500 is a wasteful number, since it uses less digits than its factorization.
11030120500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 450242 (or 450223 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 13.
Adding to 11030120500 its reverse (502103011), we get a palindrome (11532223511).
The spelling of 11030120500 in words is "eleven billion, thirty million, one hundred twenty thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •