Base | Representation |
---|---|
bin | 100001011000010… |
… | …1001010110000001 |
3 | 2220001120100201021 |
4 | 1002300221112001 |
5 | 4243213023023 |
6 | 303050305441 |
7 | 36520153363 |
oct | 10260512601 |
9 | 2801510637 |
10 | 1120048513 |
11 | 525269031 |
12 | 273128281 |
13 | 14b0801cc |
14 | a8a7ad33 |
15 | 684e635d |
hex | 42c29581 |
1120048513 has 2 divisors, whose sum is σ = 1120048514. Its totient is φ = 1120048512.
The previous prime is 1120048487. The next prime is 1120048529. The reversal of 1120048513 is 3158400211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 700290369 + 419758144 = 26463^2 + 20488^2 .
It is a cyclic number.
It is not a de Polignac number, because 1120048513 - 217 = 1119917441 is a prime.
It is a super-2 number, since 2×11200485132 = 2509017342947022338, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1120048543) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560024256 + 560024257.
It is an arithmetic number, because the mean of its divisors is an integer number (560024257).
Almost surely, 21120048513 is an apocalyptic number.
It is an amenable number.
1120048513 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120048513 is an equidigital number, since it uses as much as digits as its factorization.
1120048513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 960, while the sum is 25.
The square root of 1120048513 is about 33467.1258550835. The cubic root of 1120048513 is about 1038.5138144077.
Adding to 1120048513 its reverse (3158400211), we get a palindrome (4278448724).
The spelling of 1120048513 in words is "one billion, one hundred twenty million, forty-eight thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •