Base | Representation |
---|---|
bin | 10100011111111000… |
… | …10000001001100101 |
3 | 1001101221121101100210 |
4 | 22033330100021211 |
5 | 140014221340034 |
6 | 5020000330033 |
7 | 536465601540 |
oct | 121774201145 |
9 | 31357541323 |
10 | 11004871269 |
11 | 4737a65737 |
12 | 2171613919 |
13 | 1064c41962 |
14 | 7657bb857 |
15 | 4462028e9 |
hex | 28ff10265 |
11004871269 has 32 divisors (see below), whose sum is σ = 17660231680. Its totient is φ = 5954720832.
The previous prime is 11004871223. The next prime is 11004871279. The reversal of 11004871269 is 96217840011.
It is not a de Polignac number, because 11004871269 - 215 = 11004838501 is a prime.
It is a super-2 number, since 2×110048712692 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11004871279) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1062972 + ... + 1073274.
It is an arithmetic number, because the mean of its divisors is an integer number (551882240).
Almost surely, 211004871269 is an apocalyptic number.
11004871269 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
11004871269 is a deficient number, since it is larger than the sum of its proper divisors (6655360411).
11004871269 is a wasteful number, since it uses less digits than its factorization.
11004871269 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13009.
The product of its (nonzero) digits is 24192, while the sum is 39.
The spelling of 11004871269 in words is "eleven billion, four million, eight hundred seventy-one thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •