Base | Representation |
---|---|
bin | 10100100010001110… |
… | …11011110110100100 |
3 | 1001110022200200122221 |
4 | 22101013123312210 |
5 | 140034243030004 |
6 | 5021543002124 |
7 | 540125245444 |
oct | 122107336644 |
9 | 31408620587 |
10 | 11024580004 |
11 | 47480a7149 |
12 | 2178139344 |
13 | 1069052629 |
14 | 76826c124 |
15 | 447ce7354 |
hex | 2911dbda4 |
11024580004 has 27 divisors (see below), whose sum is σ = 19729901793. Its totient is φ = 5390177328.
The previous prime is 11024580001. The next prime is 11024580013. The reversal of 11024580004 is 40008542011.
The square root of 11024580004 is 104998.
It is a perfect power (a square), and thus also a powerful number.
11024580004 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 487968100 + 10536611904 = 22090^2 + 102648^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11024580001) by changing a digit.
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 8 ways as a sum of consecutive naturals, for example, 9869254 + ... + 9870370.
Almost surely, 211024580004 is an apocalyptic number.
11024580004 is the 104998-th square number.
It is an amenable number.
11024580004 is a deficient number, since it is larger than the sum of its proper divisors (8705321789).
11024580004 is an frugal number, since it uses more digits than its factorization.
11024580004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2332 (or 1166 counting only the distinct ones).
The product of its (nonzero) digits is 1280, while the sum is 25.
Multiplying 11024580004 by its sum of digits (25), we get a square (275614500100 = 5249902).
The spelling of 11024580004 in words is "eleven billion, twenty-four million, five hundred eighty thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •