Base | Representation |
---|---|
bin | 1011110101000001111… |
… | …1111001001101111101 |
3 | 201102112022222212001021 |
4 | 2331100133321031331 |
5 | 11312140241013041 |
6 | 233204421144141 |
7 | 20452555336243 |
oct | 2752037711575 |
9 | 642468885037 |
10 | 203214001021 |
11 | 79201007799 |
12 | 33473b5b051 |
13 | 16217150725 |
14 | 9b9acb2793 |
15 | 54456dacd1 |
hex | 2f507f937d |
203214001021 has 2 divisors, whose sum is σ = 203214001022. Its totient is φ = 203214001020.
The previous prime is 203214000973. The next prime is 203214001037. The reversal of 203214001021 is 120100412302.
It is an a-pointer prime, because the next prime (203214001037) can be obtained adding 203214001021 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 192343644900 + 10870356121 = 438570^2 + 104261^2 .
It is a cyclic number.
It is not a de Polignac number, because 203214001021 - 27 = 203214000893 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 203214000986 and 203214001004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (203214001321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101607000510 + 101607000511.
It is an arithmetic number, because the mean of its divisors is an integer number (101607000511).
Almost surely, 2203214001021 is an apocalyptic number.
It is an amenable number.
203214001021 is a deficient number, since it is larger than the sum of its proper divisors (1).
203214001021 is an equidigital number, since it uses as much as digits as its factorization.
203214001021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 203214001021 its reverse (120100412302), we get a palindrome (323314413323).
The spelling of 203214001021 in words is "two hundred three billion, two hundred fourteen million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •