Base | Representation |
---|---|
bin | 1011110101000001100… |
… | …1000110101110000111 |
3 | 201102112012122102202101 |
4 | 2331100121012232013 |
5 | 11312134312040234 |
6 | 233204315052531 |
7 | 20452534244512 |
oct | 2752031065607 |
9 | 642465572671 |
10 | 203212221319 |
11 | 79200001668 |
12 | 33473441147 |
13 | 16216979653 |
14 | 9b9a96bd79 |
15 | 5445488814 |
hex | 2f50646b87 |
203212221319 has 2 divisors, whose sum is σ = 203212221320. Its totient is φ = 203212221318.
The previous prime is 203212221271. The next prime is 203212221367. The reversal of 203212221319 is 913122212302.
203212221319 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (203212221271) and next prime (203212221367).
It is a cyclic number.
It is not a de Polignac number, because 203212221319 - 217 = 203212090247 is a prime.
It is a super-2 number, since 2×2032122213192 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (203212231319) 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, 101606110659 + 101606110660.
It is an arithmetic number, because the mean of its divisors is an integer number (101606110660).
Almost surely, 2203212221319 is an apocalyptic number.
203212221319 is a deficient number, since it is larger than the sum of its proper divisors (1).
203212221319 is an equidigital number, since it uses as much as digits as its factorization.
203212221319 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 28.
The spelling of 203212221319 in words is "two hundred three billion, two hundred twelve million, two hundred twenty-one thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •