Base | Representation |
---|---|
bin | 1010000011011001101100… |
… | …0111010111101110110101 |
3 | 1110010201011010112211010101 |
4 | 2200312123013113232311 |
5 | 2422100134113101201 |
6 | 35301533211354101 |
7 | 2220410232263206 |
oct | 240663307275665 |
9 | 43121133484111 |
10 | 11053553253301 |
11 | 3581870711839 |
12 | 12a6304752931 |
13 | 622465387510 |
14 | 2a2dcdb675ad |
15 | 1427dce79d01 |
hex | a0d9b1d7bb5 |
11053553253301 has 8 divisors (see below), whose sum is σ = 11912797078784. Its totient is φ = 10195590927600.
The previous prime is 11053553253251. The next prime is 11053553253331. The reversal of 11053553253301 is 10335235535011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11053553253301 - 225 = 11053519698869 is a prime.
It is a super-2 number, since 2×110535532533012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11053553253331) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 320357025 + ... + 320391526.
It is an arithmetic number, because the mean of its divisors is an integer number (1489099634848).
Almost surely, 211053553253301 is an apocalyptic number.
It is an amenable number.
11053553253301 is a deficient number, since it is larger than the sum of its proper divisors (859243825483).
11053553253301 is a wasteful number, since it uses less digits than its factorization.
11053553253301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 640749891.
The product of its (nonzero) digits is 101250, while the sum is 37.
Adding to 11053553253301 its reverse (10335235535011), we get a palindrome (21388788788312).
The spelling of 11053553253301 in words is "eleven trillion, fifty-three billion, five hundred fifty-three million, two hundred fifty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •