Base | Representation |
---|---|
bin | 10100111010001001… |
… | …11010010100101101 |
3 | 1001222022021112020211 |
4 | 22131010322110231 |
5 | 140442130314343 |
6 | 5053511542421 |
7 | 545113002505 |
oct | 123504722455 |
9 | 31868245224 |
10 | 11225244973 |
11 | 48403a3768 |
12 | 221338aa11 |
13 | 109b7b04b7 |
14 | 786b84a05 |
15 | 45a73379d |
hex | 29d13a52d |
11225244973 has 8 divisors (see below), whose sum is σ = 11867650400. Its totient is φ = 10587999888.
The previous prime is 11225244941. The next prime is 11225244997. The reversal of 11225244973 is 37944252211.
11225244973 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11225244973 - 25 = 11225244941 is a prime.
It is a super-2 number, since 2×112252449732 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11225244913) 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 7 ways as a sum of consecutive naturals, for example, 1285611 + ... + 1294312.
It is an arithmetic number, because the mean of its divisors is an integer number (1483456300).
Almost surely, 211225244973 is an apocalyptic number.
It is an amenable number.
11225244973 is a deficient number, since it is larger than the sum of its proper divisors (642405427).
11225244973 is a wasteful number, since it uses less digits than its factorization.
11225244973 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2580171.
The product of its digits is 120960, while the sum is 40.
The spelling of 11225244973 in words is "eleven billion, two hundred twenty-five million, two hundred forty-four thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •