Base | Representation |
---|---|
bin | 1011110000100101010… |
… | …1100100001111011011 |
3 | 201022110010110222021022 |
4 | 2330021111210033123 |
5 | 11302214122030243 |
6 | 232450132033055 |
7 | 20411150420252 |
oct | 2741125441733 |
9 | 638403428238 |
10 | 202020111323 |
11 | 787490a4798 |
12 | 331a016278b |
13 | 160869b8514 |
14 | 9ac64d3799 |
15 | 53c59aab68 |
hex | 2f095643db |
202020111323 has 4 divisors (see below), whose sum is σ = 210803594448. Its totient is φ = 193236628200.
The previous prime is 202020111313. The next prime is 202020111331. The reversal of 202020111323 is 323111020202.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 323111020202 = 2 ⋅161555510101.
It is a cyclic number.
It is not a de Polignac number, because 202020111323 - 224 = 202003334107 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (202020111313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4391741528 + ... + 4391741573.
It is an arithmetic number, because the mean of its divisors is an integer number (52700898612).
Almost surely, 2202020111323 is an apocalyptic number.
202020111323 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
202020111323 is a deficient number, since it is larger than the sum of its proper divisors (8783483125).
202020111323 is an equidigital number, since it uses as much as digits as its factorization.
202020111323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8783483124.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 202020111323 its reverse (323111020202), we get a palindrome (525131131525).
The spelling of 202020111323 in words is "two hundred two billion, twenty million, one hundred eleven thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •