Base | Representation |
---|---|
bin | 10100111101011110… |
… | …00111001101001001 |
3 | 1002001020122221120222 |
4 | 22132233013031021 |
5 | 141021242210001 |
6 | 5100344355425 |
7 | 545601433664 |
oct | 123657071511 |
9 | 32036587528 |
10 | 11253085001 |
11 | 4855089354 |
12 | 2220775b75 |
13 | 10a44aa2a2 |
14 | 78a7506db |
15 | 45cdd261b |
hex | 29ebc7349 |
11253085001 has 4 divisors (see below), whose sum is σ = 11255735172. Its totient is φ = 11250434832.
The previous prime is 11253084991. The next prime is 11253085007. The reversal of 11253085001 is 10058035211.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10058035211 = 7 ⋅1436862173.
It can be written as a sum of positive squares in 2 ways, for example, as 525097225 + 10727987776 = 22915^2 + 103576^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11253085001 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11253085007) 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, 1318706 + ... + 1327211.
It is an arithmetic number, because the mean of its divisors is an integer number (2813933793).
Almost surely, 211253085001 is an apocalyptic number.
It is an amenable number.
11253085001 is a deficient number, since it is larger than the sum of its proper divisors (2650171).
11253085001 is an equidigital number, since it uses as much as digits as its factorization.
11253085001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2650170.
The product of its (nonzero) digits is 1200, while the sum is 26.
The spelling of 11253085001 in words is "eleven billion, two hundred fifty-three million, eighty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.020 sec. • engine limits •