Base | Representation |
---|---|
bin | 1011110000100010111… |
… | …1000111010100100101 |
3 | 201022102102111212012201 |
4 | 2330020233013110211 |
5 | 11302204032001042 |
6 | 232445132014501 |
7 | 20410665635566 |
oct | 2741057072445 |
9 | 638372455181 |
10 | 202010031397 |
11 | 7874343a579 |
12 | 33198901431 |
13 | 16084899475 |
14 | 9ac502c16d |
15 | 53c4b691b7 |
hex | 2f08bc7525 |
202010031397 has 2 divisors, whose sum is σ = 202010031398. Its totient is φ = 202010031396.
The previous prime is 202010031259. The next prime is 202010031403. The reversal of 202010031397 is 793130010202.
202010031397 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., 193528726561 + 8481304836 = 439919^2 + 92094^2 .
It is a cyclic number.
It is not a de Polignac number, because 202010031397 - 227 = 201875813669 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202010032397) 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, 101005015698 + 101005015699.
It is an arithmetic number, because the mean of its divisors is an integer number (101005015699).
Almost surely, 2202010031397 is an apocalyptic number.
It is an amenable number.
202010031397 is a deficient number, since it is larger than the sum of its proper divisors (1).
202010031397 is an equidigital number, since it uses as much as digits as its factorization.
202010031397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 28.
Adding to 202010031397 its reverse (793130010202), we get a palindrome (995140041599).
The spelling of 202010031397 in words is "two hundred two billion, ten million, thirty-one thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •