Base | Representation |
---|---|
bin | 11101101110001000110… |
… | …10001000000011100111 |
3 | 10121121220100112120122212 |
4 | 32313010122020003213 |
5 | 113212410310312411 |
6 | 2101044532114035 |
7 | 133531230311162 |
oct | 16670432100347 |
9 | 3547810476585 |
10 | 1021202432231 |
11 | 3640a9172063 |
12 | 145aba76591b |
13 | 753b6b09a27 |
14 | 375d82d2ad9 |
15 | 1b86cd4d68b |
hex | edc46880e7 |
1021202432231 has 2 divisors, whose sum is σ = 1021202432232. Its totient is φ = 1021202432230.
The previous prime is 1021202432221. The next prime is 1021202432347. The reversal of 1021202432231 is 1322342021201.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1021202432231 is a prime.
It is a super-2 number, since 2×10212024322312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1021202432197 and 1021202432206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1021202432221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510601216115 + 510601216116.
It is an arithmetic number, because the mean of its divisors is an integer number (510601216116).
Almost surely, 21021202432231 is an apocalyptic number.
1021202432231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1021202432231 is an equidigital number, since it uses as much as digits as its factorization.
1021202432231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 1021202432231 its reverse (1322342021201), we get a palindrome (2343544453432).
The spelling of 1021202432231 in words is "one trillion, twenty-one billion, two hundred two million, four hundred thirty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •