Base | Representation |
---|---|
bin | 101000010011101… |
… | …1010111001001001 |
3 | 10111020222200100211 |
4 | 1100213122321021 |
5 | 10232220323144 |
6 | 342113001121 |
7 | 45342103621 |
oct | 12047327111 |
9 | 3436880324 |
10 | 1352511049 |
11 | 63450362a |
12 | 318b531a1 |
13 | 1872922c6 |
14 | cb8ad881 |
15 | 7db14034 |
hex | 509dae49 |
1352511049 has 2 divisors, whose sum is σ = 1352511050. Its totient is φ = 1352511048.
The previous prime is 1352511031. The next prime is 1352511071. The reversal of 1352511049 is 9401152531.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1290605625 + 61905424 = 35925^2 + 7868^2 .
It is an emirp because it is prime and its reverse (9401152531) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1352511049 - 27 = 1352510921 is a prime.
It is a super-2 number, since 2×13525110492 = 3658572275334160802, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1352511049.
It is not a weakly prime, because it can be changed into another prime (1352511079) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 676255524 + 676255525.
It is an arithmetic number, because the mean of its divisors is an integer number (676255525).
Almost surely, 21352511049 is an apocalyptic number.
It is an amenable number.
1352511049 is a deficient number, since it is larger than the sum of its proper divisors (1).
1352511049 is an equidigital number, since it uses as much as digits as its factorization.
1352511049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5400, while the sum is 31.
The square root of 1352511049 is about 36776.5013153780. The cubic root of 1352511049 is about 1105.8942684019.
The spelling of 1352511049 in words is "one billion, three hundred fifty-two million, five hundred eleven thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •