Base | Representation |
---|---|
bin | 1011110000111000100… |
… | …0011000111111011101 |
3 | 201022122201211100102002 |
4 | 2330032020120333131 |
5 | 11302400214342303 |
6 | 232502124012045 |
7 | 20413145163254 |
oct | 2741610307735 |
9 | 638581740362 |
10 | 202100543453 |
11 | 7878a540626 |
12 | 33203091025 |
13 | 1609a56a4b3 |
14 | 9ad306d79b |
15 | 53cca97788 |
hex | 2f0e218fdd |
202100543453 has 24 divisors (see below), whose sum is σ = 213939736920. Its totient is φ = 190621558400.
The previous prime is 202100543441. The next prime is 202100543479. The reversal of 202100543453 is 354345001202.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 14699865049 + 187400678404 = 121243^2 + 432898^2 .
It is not a de Polignac number, because 202100543453 - 210 = 202100542429 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202100543153) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 106311803 + ... + 106313703.
It is an arithmetic number, because the mean of its divisors is an integer number (8914155705).
Almost surely, 2202100543453 is an apocalyptic number.
It is an amenable number.
202100543453 is a deficient number, since it is larger than the sum of its proper divisors (11839193467).
202100543453 is an equidigital number, since it uses as much as digits as its factorization.
202100543453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2509 (or 2246 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 29.
Adding to 202100543453 its reverse (354345001202), we get a palindrome (556445544655).
The spelling of 202100543453 in words is "two hundred two billion, one hundred million, five hundred forty-three thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •