Base | Representation |
---|---|
bin | 10100011111011111… |
… | …01000000010100101 |
3 | 1001101201101012212121 |
4 | 22033233220002211 |
5 | 140012344430003 |
6 | 5015401345541 |
7 | 536425504414 |
oct | 121757500245 |
9 | 31351335777 |
10 | 11001561253 |
11 | 4736104891 |
12 | 21704982b1 |
13 | 1064353177 |
14 | 76519947b |
15 | 445c9bcbd |
hex | 28fbe80a5 |
11001561253 has 4 divisors (see below), whose sum is σ = 11003544448. Its totient is φ = 10999578060.
The previous prime is 11001561239. The next prime is 11001561299. The reversal of 11001561253 is 35216510011.
It is a happy number.
11001561253 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 a cyclic number.
It is not a de Polignac number, because 11001561253 - 213 = 11001553061 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001571253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 983253 + ... + 994378.
It is an arithmetic number, because the mean of its divisors is an integer number (2750886112).
Almost surely, 211001561253 is an apocalyptic number.
It is an amenable number.
11001561253 is a deficient number, since it is larger than the sum of its proper divisors (1983195).
11001561253 is an equidigital number, since it uses as much as digits as its factorization.
11001561253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1983194.
The product of its (nonzero) digits is 900, while the sum is 25.
The spelling of 11001561253 in words is "eleven billion, one million, five hundred sixty-one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •