Base | Representation |
---|---|
bin | 100001000011100… |
… | …0110001001000000 |
3 | 2212022001222120021 |
4 | 1002013012021000 |
5 | 4232421001131 |
6 | 302021023224 |
7 | 36325450114 |
oct | 10207061100 |
9 | 2768058507 |
10 | 1109156416 |
11 | 51a0a96a5 |
12 | 26b554b14 |
13 | 148a38594 |
14 | a7443744 |
15 | 67593e11 |
hex | 421c6240 |
1109156416 has 63 divisors (see below), whose sum is σ = 2313619833. Its totient is φ = 527535360.
The previous prime is 1109156413. The next prime is 1109156429. The reversal of 1109156416 is 6146519011.
The square root of 1109156416 is 33304.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 12222016 + 1096934400 = 3496^2 + 33120^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1109156413) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 6127846 + ... + 6128026.
Almost surely, 21109156416 is an apocalyptic number.
1109156416 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
1109156416 is the 33304-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1109156416
1109156416 is an abundant number, since it is smaller than the sum of its proper divisors (1204463417).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1109156416 is an frugal number, since it uses more digits than its factorization.
1109156416 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 420 (or 206 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 34.
The cubic root of 1109156416 is about 1035.1364429174.
The spelling of 1109156416 in words is "one billion, one hundred nine million, one hundred fifty-six thousand, four hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •