Base | Representation |
---|---|
bin | 1010001111011011001110… |
… | …0101110110110000001001 |
3 | 1110212110100021201002010102 |
4 | 2203312303211312300021 |
5 | 2433441212303444243 |
6 | 35540455003455145 |
7 | 2241342220403543 |
oct | 243666345666011 |
9 | 43773307632112 |
10 | 11260122328073 |
11 | 365143355a053 |
12 | 131a3542274b5 |
13 | 638a95630b88 |
14 | 2acdc8470693 |
15 | 147d7ce969b8 |
hex | a3db3976c09 |
11260122328073 has 24 divisors (see below), whose sum is σ = 12244175898696. Its totient is φ = 10347141600000.
The previous prime is 11260122328001. The next prime is 11260122328079. The reversal of 11260122328073 is 37082322106211.
It can be written as a sum of positive squares in 4 ways, for example, as 823171514944 + 10436950813129 = 907288^2 + 3230627^2 .
It is not a de Polignac number, because 11260122328073 - 232 = 11255827360777 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11260122328079) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 361823 + ... + 4759323.
It is an arithmetic number, because the mean of its divisors is an integer number (510173995779).
Almost surely, 211260122328073 is an apocalyptic number.
It is an amenable number.
11260122328073 is a deficient number, since it is larger than the sum of its proper divisors (984053570623).
11260122328073 is a wasteful number, since it uses less digits than its factorization.
11260122328073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4397753 (or 4397734 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 38.
The spelling of 11260122328073 in words is "eleven trillion, two hundred sixty billion, one hundred twenty-two million, three hundred twenty-eight thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.037 sec. • engine limits •