Base | Representation |
---|---|
bin | 1010000100100000011101… |
… | …0010100110000010111111 |
3 | 1110012112011220112010121200 |
4 | 2201020013102212002333 |
5 | 2422403034242112111 |
6 | 35314354111030543 |
7 | 2221652030064213 |
oct | 241100722460277 |
9 | 43175156463550 |
10 | 11072548004031 |
11 | 3589928762138 |
12 | 12a9b25b0b453 |
13 | 6241a17078a7 |
14 | 2a3cb2736943 |
15 | 143050829256 |
hex | a12074a60bf |
11072548004031 has 48 divisors (see below), whose sum is σ = 17167534238400. Its totient is φ = 6863040866304.
The previous prime is 11072548004017. The next prime is 11072548004051. The reversal of 11072548004031 is 13040084527011.
11072548004031 is a `hidden beast` number, since 1 + 1 + 0 + 72 + 548 + 0 + 0 + 40 + 3 + 1 = 666.
It is not a de Polignac number, because 11072548004031 - 27 = 11072548003903 is a prime.
It is a super-2 number, since 2×110725480040312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11072548004051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4973491 + ... + 6846948.
It is an arithmetic number, because the mean of its divisors is an integer number (357656963300).
Almost surely, 211072548004031 is an apocalyptic number.
11072548004031 is a deficient number, since it is larger than the sum of its proper divisors (6094986234369).
11072548004031 is a wasteful number, since it uses less digits than its factorization.
11072548004031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11820608 (or 11820605 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 36.
The spelling of 11072548004031 in words is "eleven trillion, seventy-two billion, five hundred forty-eight million, four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •