Base | Representation |
---|---|
bin | 10100111110000101… |
… | …11001010100110001 |
3 | 1002001121102102110221 |
4 | 22133002321110301 |
5 | 141024104133100 |
6 | 5101051453041 |
7 | 545663503411 |
oct | 123702712461 |
9 | 32047372427 |
10 | 11258271025 |
11 | 4858000721 |
12 | 2222457181 |
13 | 10a55a4941 |
14 | 78b300641 |
15 | 45d5a901a |
hex | 29f0b9531 |
11258271025 has 9 divisors (see below), whose sum is σ = 13960913953. Its totient is φ = 9006192400.
The previous prime is 11258270999. The next prime is 11258271061. The reversal of 11258271025 is 52017285211.
The square root of 11258271025 is 106105.
It is a perfect power (a square), and thus also a powerful number.
11258271025 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 2138785009 + 9119486016 = 46247^2 + 95496^2 .
It is not a de Polignac number, because 11258271025 - 25 = 11258270993 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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 8 ways as a sum of consecutive naturals, for example, 519915 + ... + 541135.
Almost surely, 211258271025 is an apocalyptic number.
11258271025 is the 106105-th square number.
11258271025 is the 53053-rd centered octagonal number.
It is an amenable number.
11258271025 is a deficient number, since it is larger than the sum of its proper divisors (2702642928).
11258271025 is an frugal number, since it uses more digits than its factorization.
11258271025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42452 (or 21226 counting only the distinct ones).
The product of its (nonzero) digits is 11200, while the sum is 34.
The spelling of 11258271025 in words is "eleven billion, two hundred fifty-eight million, two hundred seventy-one thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •