Base | Representation |
---|---|
bin | 10100101111010011… |
… | …01110010110110001 |
3 | 1001201222000120220102 |
4 | 22113221232112301 |
5 | 140300330410420 |
6 | 5040501122145 |
7 | 542626260512 |
oct | 122751562661 |
9 | 31658016812 |
10 | 11134231985 |
11 | 47a3a90318 |
12 | 21a89b9355 |
13 | 1085995466 |
14 | 778a52a09 |
15 | 452756a75 |
hex | 297a6e5b1 |
11134231985 has 4 divisors (see below), whose sum is σ = 13361078388. Its totient is φ = 8907385584.
The previous prime is 11134231981. The next prime is 11134232003. The reversal of 11134231985 is 58913243111.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7501638544 + 3632593441 = 86612^2 + 60271^2 .
It is a cyclic number.
It is not a de Polignac number, because 11134231985 - 22 = 11134231981 is a prime.
It is a super-2 number, since 2×111342319852 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11134231981) 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, 1113423194 + ... + 1113423203.
It is an arithmetic number, because the mean of its divisors is an integer number (3340269597).
Almost surely, 211134231985 is an apocalyptic number.
It is an amenable number.
11134231985 is a deficient number, since it is larger than the sum of its proper divisors (2226846403).
11134231985 is an equidigital number, since it uses as much as digits as its factorization.
11134231985 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2226846402.
The product of its digits is 25920, while the sum is 38.
The spelling of 11134231985 in words is "eleven billion, one hundred thirty-four million, two hundred thirty-one thousand, nine hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •