Base | Representation |
---|---|
bin | 101000001101000… |
… | …1001111000000001 |
3 | 10111000110000000201 |
4 | 1100122021320001 |
5 | 10230323032343 |
6 | 341510245201 |
7 | 45300411124 |
oct | 12032117001 |
9 | 3430400021 |
10 | 1349033473 |
11 | 6325488a7 |
12 | 317956801 |
13 | 186645478 |
14 | cb2463bb |
15 | 7d67894d |
hex | 50689e01 |
1349033473 has 2 divisors, whose sum is σ = 1349033474. Its totient is φ = 1349033472.
The previous prime is 1349033447. The next prime is 1349033507. The reversal of 1349033473 is 3743309431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1232220609 + 116812864 = 35103^2 + 10808^2 .
It is an emirp because it is prime and its reverse (3743309431) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1349033473 is a prime.
It is a super-2 number, since 2×13490334732 = 3639782622548883458, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1349013473) 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, 674516736 + 674516737.
It is an arithmetic number, because the mean of its divisors is an integer number (674516737).
Almost surely, 21349033473 is an apocalyptic number.
It is an amenable number.
1349033473 is a deficient number, since it is larger than the sum of its proper divisors (1).
1349033473 is an equidigital number, since it uses as much as digits as its factorization.
1349033473 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81648, while the sum is 37.
The square root of 1349033473 is about 36729.1910202226. The cubic root of 1349033473 is about 1104.9456298876.
The spelling of 1349033473 in words is "one billion, three hundred forty-nine million, thirty-three thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.573 sec. • engine limits •