Base | Representation |
---|---|
bin | 11110000010110100111… |
… | …10100011111111010101 |
3 | 10122200120110121012001202 |
4 | 33001122132203333111 |
5 | 113403132342042323 |
6 | 2110123044202245 |
7 | 134403415113632 |
oct | 17013236437725 |
9 | 3580513535052 |
10 | 1032310112213 |
11 | 368889167476 |
12 | 14809a699385 |
13 | 76467136733 |
14 | 37d6d5d3189 |
15 | 1bcbd0acd28 |
hex | f05a7a3fd5 |
1032310112213 has 2 divisors, whose sum is σ = 1032310112214. Its totient is φ = 1032310112212.
The previous prime is 1032310112203. The next prime is 1032310112279. The reversal of 1032310112213 is 3122110132301.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 612998175364 + 419311936849 = 782942^2 + 647543^2 .
It is an emirp because it is prime and its reverse (3122110132301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1032310112213 - 28 = 1032310111957 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1032310112203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 516155056106 + 516155056107.
It is an arithmetic number, because the mean of its divisors is an integer number (516155056107).
Almost surely, 21032310112213 is an apocalyptic number.
It is an amenable number.
1032310112213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1032310112213 is an equidigital number, since it uses as much as digits as its factorization.
1032310112213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1032310112213 its reverse (3122110132301), we get a palindrome (4154420244514).
The spelling of 1032310112213 in words is "one trillion, thirty-two billion, three hundred ten million, one hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •