Base | Representation |
---|---|
bin | 10100101101110111… |
… | …10110101111101101 |
3 | 1001201010101200201110 |
4 | 22112323312233231 |
5 | 140234241121400 |
6 | 5035351302233 |
7 | 542422130406 |
oct | 122673665755 |
9 | 31633350643 |
10 | 11122207725 |
11 | 4798218312 |
12 | 21a497a979 |
13 | 1083345405 |
14 | 7772029ad |
15 | 45167de50 |
hex | 296ef6bed |
11122207725 has 24 divisors (see below), whose sum is σ = 18393699712. Its totient is φ = 5930236800.
The previous prime is 11122207717. The next prime is 11122207739. The reversal of 11122207725 is 52770222111.
It is not a de Polignac number, because 11122207725 - 23 = 11122207717 is a prime.
It is a super-3 number, since 3×111222077253 (a number of 31 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11122207692 and 11122207701.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 290289 + ... + 326361.
Almost surely, 211122207725 is an apocalyptic number.
11122207725 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11122207725 is a deficient number, since it is larger than the sum of its proper divisors (7271491987).
11122207725 is a wasteful number, since it uses less digits than its factorization.
11122207725 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40197 (or 40192 counting only the distinct ones).
The product of its (nonzero) digits is 3920, while the sum is 30.
Adding to 11122207725 its reverse (52770222111), we get a palindrome (63892429836).
The spelling of 11122207725 in words is "eleven billion, one hundred twenty-two million, two hundred seven thousand, seven hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •