Base | Representation |
---|---|
bin | 101110001101001001000011… |
… | …001101110010011100011101 |
3 | 222122111222211000202100202002 |
4 | 232031021003031302130131 |
5 | 203113421123321042114 |
6 | 2000110505434212045 |
7 | 60542445535426112 |
oct | 5615110315623435 |
9 | 878458730670662 |
10 | 203213210330909 |
11 | 59828269524379 |
12 | 1a9600b8b84025 |
13 | 8950c00c432ac |
14 | 3827801278909 |
15 | 18760968a47de |
hex | b8d24337271d |
203213210330909 has 2 divisors, whose sum is σ = 203213210330910. Its totient is φ = 203213210330908.
The previous prime is 203213210330849. The next prime is 203213210330957. The reversal of 203213210330909 is 909033012312302.
203213210330909 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 202316571782809 + 896638548100 = 14223803^2 + 946910^2 .
It is a cyclic number.
It is not a de Polignac number, because 203213210330909 - 28 = 203213210330653 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (203213210330969) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101606605165454 + 101606605165455.
It is an arithmetic number, because the mean of its divisors is an integer number (101606605165455).
Almost surely, 2203213210330909 is an apocalyptic number.
It is an amenable number.
203213210330909 is a deficient number, since it is larger than the sum of its proper divisors (1).
203213210330909 is an equidigital number, since it uses as much as digits as its factorization.
203213210330909 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 52488, while the sum is 38.
The spelling of 203213210330909 in words is "two hundred three trillion, two hundred thirteen billion, two hundred ten million, three hundred thirty thousand, nine hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •