Base | Representation |
---|---|
bin | 1010010010100010010001… |
… | …1100010010001111101001 |
3 | 1111001120021010011212100100 |
4 | 2210220210130102033221 |
5 | 2440330130121032301 |
6 | 40021213040500013 |
7 | 2245243305641466 |
oct | 244504434221751 |
9 | 44046233155310 |
10 | 11313555252201 |
11 | 3672062aa5884 |
12 | 132878691a609 |
13 | 640b2c683647 |
14 | 2b1816a9c66d |
15 | 149458de9286 |
hex | a4a247123e9 |
11313555252201 has 24 divisors (see below), whose sum is σ = 16785216523400. Its totient is φ = 7337759694336.
The previous prime is 11313555252199. The next prime is 11313555252271. The reversal of 11313555252201 is 10225255531311.
11313555252201 is a `hidden beast` number, since 1 + 1 + 3 + 1 + 35 + 552 + 52 + 20 + 1 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 382729059801 + 10930826192400 = 618651^2 + 3306180^2 .
It is not a de Polignac number, because 11313555252201 - 21 = 11313555252199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11313555252271) 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 23 ways as a sum of consecutive naturals, for example, 1452591 + ... + 4973643.
Almost surely, 211313555252201 is an apocalyptic number.
It is an amenable number.
11313555252201 is a deficient number, since it is larger than the sum of its proper divisors (5471661271199).
11313555252201 is a wasteful number, since it uses less digits than its factorization.
11313555252201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3530745 (or 3530742 counting only the distinct ones).
The product of its (nonzero) digits is 45000, while the sum is 36.
The spelling of 11313555252201 in words is "eleven trillion, three hundred thirteen billion, five hundred fifty-five million, two hundred fifty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •