Base | Representation |
---|---|
bin | 111111111011010… |
… | …100001010000101 |
3 | 2202202010100011111 |
4 | 333323110022011 |
5 | 4144030414134 |
6 | 254231405021 |
7 | 35402134003 |
oct | 7773241205 |
9 | 2682110144 |
10 | 1072513669 |
11 | 500451437 |
12 | 25b223771 |
13 | 141278b96 |
14 | a2625a73 |
15 | 64256c64 |
hex | 3fed4285 |
1072513669 has 2 divisors, whose sum is σ = 1072513670. Its totient is φ = 1072513668.
The previous prime is 1072513661. The next prime is 1072513723. The reversal of 1072513669 is 9663152701.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1033301025 + 39212644 = 32145^2 + 6262^2 .
It is an emirp because it is prime and its reverse (9663152701) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1072513669 - 23 = 1072513661 is a prime.
It is a super-2 number, since 2×10725136692 = 2300571140383683122, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1072513661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 536256834 + 536256835.
It is an arithmetic number, because the mean of its divisors is an integer number (536256835).
Almost surely, 21072513669 is an apocalyptic number.
It is an amenable number.
1072513669 is a deficient number, since it is larger than the sum of its proper divisors (1).
1072513669 is an equidigital number, since it uses as much as digits as its factorization.
1072513669 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 68040, while the sum is 40.
The square root of 1072513669 is about 32749.2544800641. The cubic root of 1072513669 is about 1023.6094310901.
The spelling of 1072513669 in words is "one billion, seventy-two million, five hundred thirteen thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •