Base | Representation |
---|---|
bin | 1010010100111101100111… |
… | …0101101101111100111111 |
3 | 1111012112220010102012222010 |
4 | 2211033121311231330333 |
5 | 2442021024321113210 |
6 | 40052310434422303 |
7 | 2251250522340156 |
oct | 245173165557477 |
9 | 44175803365863 |
10 | 11355253301055 |
11 | 3688810504084 |
12 | 1334883431993 |
13 | 644a4647b331 |
14 | 2b38509a459d |
15 | 14a5999eb920 |
hex | a53d9d6df3f |
11355253301055 has 16 divisors (see below), whose sum is σ = 18554967097344. Its totient is φ = 5927281155360.
The previous prime is 11355253301033. The next prime is 11355253301069. The reversal of 11355253301055 is 55010335255311.
It is not a de Polignac number, because 11355253301055 - 28 = 11355253300799 is a prime.
It is a super-2 number, since 2×113552533010552 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8053370431 + ... + 8053371840.
It is an arithmetic number, because the mean of its divisors is an integer number (1159685443584).
Almost surely, 211355253301055 is an apocalyptic number.
11355253301055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11355253301055 is a deficient number, since it is larger than the sum of its proper divisors (7199713796289).
11355253301055 is a wasteful number, since it uses less digits than its factorization.
11355253301055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16106742326.
The product of its (nonzero) digits is 168750, while the sum is 39.
Adding to 11355253301055 its reverse (55010335255311), we get a palindrome (66365588556366).
The spelling of 11355253301055 in words is "eleven trillion, three hundred fifty-five billion, two hundred fifty-three million, three hundred one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •