Base | Representation |
---|---|
bin | 10100100101001100… |
… | …00000111100010000 |
3 | 1001112001100022212221 |
4 | 22102212000330100 |
5 | 140112114422311 |
6 | 5024230230424 |
7 | 540546060532 |
oct | 122246007420 |
9 | 31461308787 |
10 | 11049373456 |
11 | 47600a0900 |
12 | 21844b5414 |
13 | 1071223804 |
14 | 76b683852 |
15 | 44a093671 |
hex | 292980f10 |
11049373456 has 45 divisors (see below), whose sum is σ = 23541138453. Its totient is φ = 5020340160.
The previous prime is 11049373453. The next prime is 11049373537. The reversal of 11049373456 is 65437394011.
The square root of 11049373456 is 105116.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 2511613456 + 8537760000 = 50116^2 + 92400^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11049373453) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 4623910 + ... + 4626298.
Almost surely, 211049373456 is an apocalyptic number.
11049373456 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
11049373456 is the 105116-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11049373456
11049373456 is an abundant number, since it is smaller than the sum of its proper divisors (12491764997).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11049373456 is an frugal number, since it uses more digits than its factorization.
11049373456 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4808 (or 2402 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 43.
The spelling of 11049373456 in words is "eleven billion, forty-nine million, three hundred seventy-three thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •