Base | Representation |
---|---|
bin | 101101111011101000011111… |
… | …101011001000110011100111 |
3 | 222111020222011211220022212001 |
4 | 231323220133223020303213 |
5 | 202434213011414431043 |
6 | 1553350042402310131 |
7 | 60356512456531111 |
oct | 5573503753106347 |
9 | 874228154808761 |
10 | 202010023202023 |
11 | 59403a73786173 |
12 | 1a7a6a90058347 |
13 | 889460427540a |
14 | 37c54a17563b1 |
15 | 1854b26eae74d |
hex | b7ba1fac8ce7 |
202010023202023 has 16 divisors (see below), whose sum is σ = 212950145132640. Its totient is φ = 191100770380800.
The previous prime is 202010023202017. The next prime is 202010023202089. The reversal of 202010023202023 is 320202320010202.
It is not a de Polignac number, because 202010023202023 - 25 = 202010023201991 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202010023232023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 107175663 + ... + 109044223.
It is an arithmetic number, because the mean of its divisors is an integer number (13309384070790).
Almost surely, 2202010023202023 is an apocalyptic number.
202010023202023 is a deficient number, since it is larger than the sum of its proper divisors (10940121930617).
202010023202023 is a wasteful number, since it uses less digits than its factorization.
202010023202023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1876818.
The product of its (nonzero) digits is 576, while the sum is 19.
Adding to 202010023202023 its reverse (320202320010202), we get a palindrome (522212343212225).
The spelling of 202010023202023 in words is "two hundred two trillion, ten billion, twenty-three million, two hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •