Base | Representation |
---|---|
bin | 10101110111000110… |
… | …00101101010100001 |
3 | 1010021221020120012111 |
4 | 22323203011222201 |
5 | 143014014102400 |
6 | 5220333155321 |
7 | 563561240122 |
oct | 127343055241 |
9 | 33257216174 |
10 | 11736472225 |
11 | 4a82a29325 |
12 | 233662bb41 |
13 | 115069692a |
14 | 7d4a20049 |
15 | 48a5683ba |
hex | 2bb8c5aa1 |
11736472225 has 27 divisors (see below), whose sum is σ = 14901781561. Its totient is φ = 9169474400.
The previous prime is 11736472217. The next prime is 11736472247. The reversal of 11736472225 is 52227463711.
The square root of 11736472225 is 108335.
It is a perfect power (a square), and thus also a powerful number.
11736472225 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 1199860321 + 10536611904 = 34639^2 + 102648^2 .
It is not a de Polignac number, because 11736472225 - 23 = 11736472217 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 26 ways as a sum of consecutive naturals, for example, 25458495 + ... + 25458955.
Almost surely, 211736472225 is an apocalyptic number.
11736472225 is the 108335-th square number.
11736472225 is the 54168-th centered octagonal number.
It is an amenable number.
11736472225 is a deficient number, since it is larger than the sum of its proper divisors (3165309336).
11736472225 is an frugal number, since it uses more digits than its factorization.
11736472225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1026 (or 513 counting only the distinct ones).
The product of its digits is 141120, while the sum is 40.
The spelling of 11736472225 in words is "eleven billion, seven hundred thirty-six million, four hundred seventy-two thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •