Base | Representation |
---|---|
bin | 111101100010000… |
… | …110101000000101 |
3 | 2122221112211021002 |
4 | 331202012220011 |
5 | 4103240201323 |
6 | 250234503045 |
7 | 34403555246 |
oct | 7542065005 |
9 | 2587484232 |
10 | 1032350213 |
11 | 48a809aa4 |
12 | 249894a85 |
13 | 135b55b1b |
14 | 9b16cccd |
15 | 60971828 |
hex | 3d886a05 |
1032350213 has 2 divisors, whose sum is σ = 1032350214. Its totient is φ = 1032350212.
The previous prime is 1032350197. The next prime is 1032350219. The reversal of 1032350213 is 3120532301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 529828324 + 502521889 = 23018^2 + 22417^2 .
It is a cyclic number.
It is not a de Polignac number, because 1032350213 - 24 = 1032350197 is a prime.
It is a super-2 number, since 2×10323502132 = 2131493924562290738, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1032350219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 516175106 + 516175107.
It is an arithmetic number, because the mean of its divisors is an integer number (516175107).
Almost surely, 21032350213 is an apocalyptic number.
It is an amenable number.
1032350213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1032350213 is an equidigital number, since it uses as much as digits as its factorization.
1032350213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 20.
The square root of 1032350213 is about 32130.2071733128. The cubic root of 1032350213 is about 1010.6691683521.
Adding to 1032350213 its reverse (3120532301), we get a palindrome (4152882514).
The spelling of 1032350213 in words is "one billion, thirty-two million, three hundred fifty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •