Base | Representation |
---|---|
bin | 10100101110010001… |
… | …00000110001101101 |
3 | 1001201100122021000012 |
4 | 22113020200301231 |
5 | 140241113304423 |
6 | 5035550343005 |
7 | 542462256506 |
oct | 122710406155 |
9 | 31640567005 |
10 | 11125525613 |
11 | 479a084074 |
12 | 21a5abaa65 |
13 | 1083c37667 |
14 | 777827bad |
15 | 451ad7078 |
hex | 297220c6d |
11125525613 has 4 divisors (see below), whose sum is σ = 11484413568. Its totient is φ = 10766637660.
The previous prime is 11125525559. The next prime is 11125525633. The reversal of 11125525613 is 31652552111.
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, and also an emirpimes, since its reverse is a distinct semiprime: 31652552111 = 787 ⋅40219253.
It is a cyclic number.
It is not a de Polignac number, because 11125525613 - 218 = 11125263469 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11125525613.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11125525633) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 179443931 + ... + 179443992.
It is an arithmetic number, because the mean of its divisors is an integer number (2871103392).
Almost surely, 211125525613 is an apocalyptic number.
It is an amenable number.
11125525613 is a deficient number, since it is larger than the sum of its proper divisors (358887955).
11125525613 is an equidigital number, since it uses as much as digits as its factorization.
11125525613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 358887954.
The product of its digits is 9000, while the sum is 32.
The spelling of 11125525613 in words is "eleven billion, one hundred twenty-five million, five hundred twenty-five thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •