Base | Representation |
---|---|
bin | 1010001110100100100000… |
… | …0100101010111101111111 |
3 | 1110211001102121012121022111 |
4 | 2203221020010222331333 |
5 | 2433221121443040210 |
6 | 35530025244354451 |
7 | 2240312220104554 |
oct | 243511004527577 |
9 | 43731377177274 |
10 | 11245433565055 |
11 | 3646186096a88 |
12 | 1317534b45a27 |
13 | 637594418521 |
14 | 2ac3d3706a2b |
15 | 1477bd66088a |
hex | a3a4812af7f |
11245433565055 has 4 divisors (see below), whose sum is σ = 13494520278072. Its totient is φ = 8996346852040.
The previous prime is 11245433565049. The next prime is 11245433565137. The reversal of 11245433565055 is 55056533454211.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 11245433565055 - 27 = 11245433564927 is a prime.
It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1124543356501 + ... + 1124543356510.
It is an arithmetic number, because the mean of its divisors is an integer number (3373630069518).
Almost surely, 211245433565055 is an apocalyptic number.
11245433565055 is a deficient number, since it is larger than the sum of its proper divisors (2249086713017).
11245433565055 is an equidigital number, since it uses as much as digits as its factorization.
11245433565055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2249086713016.
The product of its (nonzero) digits is 5400000, while the sum is 49.
The spelling of 11245433565055 in words is "eleven trillion, two hundred forty-five billion, four hundred thirty-three million, five hundred sixty-five thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •