Base | Representation |
---|---|
bin | 1010010011001101101010… |
… | …0010000011011010011101 |
3 | 1111002200022200010002002200 |
4 | 2210303122202003122131 |
5 | 2441023002214332341 |
6 | 40030420343242113 |
7 | 2246135005650354 |
oct | 244633242033235 |
9 | 44080280102080 |
10 | 11325200152221 |
11 | 3676a9926959a |
12 | 132aa96749339 |
13 | 641c67097827 |
14 | 2b21dd48299b |
15 | 1498db3c4db6 |
hex | a4cda88369d |
11325200152221 has 12 divisors (see below), whose sum is σ = 16428831125148. Its totient is φ = 7517729427264.
The previous prime is 11325200152207. The next prime is 11325200152241. The reversal of 11325200152221 is 12225100252311.
11325200152221 is a `hidden beast` number, since 1 + 132 + 5 + 2 + 0 + 0 + 1 + 522 + 2 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 5226646426596 + 6098553725625 = 2286186^2 + 2469525^2 .
It is not a de Polignac number, because 11325200152221 - 213 = 11325200144029 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11325200152241) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2700331750 + ... + 2700335943.
It is an arithmetic number, because the mean of its divisors is an integer number (1369069260429).
Almost surely, 211325200152221 is an apocalyptic number.
It is an amenable number.
11325200152221 is a deficient number, since it is larger than the sum of its proper divisors (5103630972927).
11325200152221 is a wasteful number, since it uses less digits than its factorization.
11325200152221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5400667932 (or 5400667929 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
The spelling of 11325200152221 in words is "eleven trillion, three hundred twenty-five billion, two hundred million, one hundred fifty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •