Base | Representation |
---|---|
bin | 10000001001100111000… |
… | …011111011010111101001 |
3 | 10221002200000011021210001 |
4 | 100021213003323113221 |
5 | 121140413121121400 |
6 | 2205503230223001 |
7 | 143116431555541 |
oct | 20114703732751 |
9 | 3832600137701 |
10 | 1109830645225 |
11 | 398749514285 |
12 | 15b114054a61 |
13 | 8086c67b003 |
14 | 3ba04d44321 |
15 | 1dd08a59a6a |
hex | 102670fb5e9 |
1109830645225 has 27 divisors (see below), whose sum is σ = 1389650335983. Its totient is φ = 879263864640.
The previous prime is 1109830645181. The next prime is 1109830645241. The reversal of 1109830645225 is 5225460389011.
The square root of 1109830645225 is 1053485.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 13 ways, for example, as 293128036569 + 816702608656 = 541413^2 + 903716^2 .
It is not a de Polignac number, because 1109830645225 - 27 = 1109830645097 is a prime.
It is a super-2 number, since 2×11098306452252 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 574148359 + ... + 574150291.
Almost surely, 21109830645225 is an apocalyptic number.
1109830645225 is the 1053485-th square number.
1109830645225 is the 526743-rd centered octagonal number.
It is an amenable number.
1109830645225 is a deficient number, since it is larger than the sum of its proper divisors (279819690758).
1109830645225 is an frugal number, since it uses more digits than its factorization.
1109830645225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4094 (or 2047 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 46.
The spelling of 1109830645225 in words is "one trillion, one hundred nine billion, eight hundred thirty million, six hundred forty-five thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •