Base | Representation |
---|---|
bin | 100101001110001… |
… | …1010001001011101 |
3 | 10020001010210120011 |
4 | 1022130122021131 |
5 | 10024213223432 |
6 | 323533323221 |
7 | 42643665025 |
oct | 11234321135 |
9 | 3201123504 |
10 | 1248961117 |
11 | 591007a78 |
12 | 2aa336511 |
13 | 16b9a7a61 |
14 | bbc36a85 |
15 | 749ac847 |
hex | 4a71a25d |
1248961117 has 8 divisors (see below), whose sum is σ = 1328700672. Its totient is φ = 1169918400.
The previous prime is 1248961099. The next prime is 1248961121. The reversal of 1248961117 is 7111698421.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1248961117 - 27 = 1248960989 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1248961117.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1248961177) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 170509 + ... + 177682.
It is an arithmetic number, because the mean of its divisors is an integer number (166087584).
Almost surely, 21248961117 is an apocalyptic number.
1248961117 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
1248961117 is a deficient number, since it is larger than the sum of its proper divisors (79739555).
1248961117 is a wasteful number, since it uses less digits than its factorization.
1248961117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 348419.
The product of its digits is 24192, while the sum is 40.
The square root of 1248961117 is about 35340.6439811161. The cubic root of 1248961117 is about 1076.9188348929.
The spelling of 1248961117 in words is "one billion, two hundred forty-eight million, nine hundred sixty-one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •