Base | Representation |
---|---|
bin | 1010001111001000010110… |
… | …0001000011111101111011 |
3 | 1110211222021002102020021012 |
4 | 2203302011201003331323 |
5 | 2433400322403233001 |
6 | 35534300043304135 |
7 | 2241102511333043 |
oct | 243620541037573 |
9 | 43758232366235 |
10 | 11255054352251 |
11 | 364a272843886 |
12 | 131937ab1b04b |
13 | 638468691c08 |
14 | 2aca67356723 |
15 | 147b830b42bb |
hex | a3c85843f7b |
11255054352251 has 8 divisors (see below), whose sum is σ = 11445919393200. Its totient is φ = 11064192691680.
The previous prime is 11255054352197. The next prime is 11255054352259. The reversal of 11255054352251 is 15225345055211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11255054352251 - 222 = 11255050157947 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11255054352199 and 11255054352208.
It is not an unprimeable number, because it can be changed into a prime (11255054352259) 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 7 ways as a sum of consecutive naturals, for example, 6391385 + ... + 7959893.
It is an arithmetic number, because the mean of its divisors is an integer number (1430739924150).
Almost surely, 211255054352251 is an apocalyptic number.
11255054352251 is a deficient number, since it is larger than the sum of its proper divisors (190865040949).
11255054352251 is a wasteful number, since it uses less digits than its factorization.
11255054352251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1690189.
The product of its (nonzero) digits is 300000, while the sum is 41.
The spelling of 11255054352251 in words is "eleven trillion, two hundred fifty-five billion, fifty-four million, three hundred fifty-two thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •