Base | Representation |
---|---|
bin | 10100111100011011… |
… | …01011011100101001 |
3 | 1002000122011200000210 |
4 | 22132031223130221 |
5 | 141012021224203 |
6 | 5055432451333 |
7 | 545434101444 |
oct | 123615533451 |
9 | 32018150023 |
10 | 11244320553 |
11 | 4850142504 |
12 | 2219849b49 |
13 | 10a272bc1b |
14 | 78950c65b |
15 | 45c250803 |
hex | 29e36b729 |
11244320553 has 4 divisors (see below), whose sum is σ = 14992427408. Its totient is φ = 7496213700.
The previous prime is 11244320551. The next prime is 11244320579. The reversal of 11244320553 is 35502344211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 11244320553 - 21 = 11244320551 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11244320553.
It is not an unprimeable number, because it can be changed into a prime (11244320551) 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 3 ways as a sum of consecutive naturals, for example, 1874053423 + ... + 1874053428.
It is an arithmetic number, because the mean of its divisors is an integer number (3748106852).
Almost surely, 211244320553 is an apocalyptic number.
It is an amenable number.
11244320553 is a deficient number, since it is larger than the sum of its proper divisors (3748106855).
11244320553 is an equidigital number, since it uses as much as digits as its factorization.
11244320553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3748106854.
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 11244320553 its reverse (35502344211), we get a palindrome (46746664764).
The spelling of 11244320553 in words is "eleven billion, two hundred forty-four million, three hundred twenty thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •