Base | Representation |
---|---|
bin | 1011110010000000000… |
… | …0011001111110011111 |
3 | 201100102122010200102212 |
4 | 2330200000121332133 |
5 | 11304004003041343 |
6 | 232551555511035 |
7 | 20423446233002 |
oct | 2744000317637 |
9 | 640378120385 |
10 | 202400440223 |
11 | 789238544a3 |
12 | 332875b847b |
13 | 161177302c7 |
14 | 9b20c17539 |
15 | 53e9085c18 |
hex | 2f20019f9f |
202400440223 has 6 divisors (see below), whose sum is σ = 207457442832. Its totient is φ = 197463842480.
The previous prime is 202400440219. The next prime is 202400440237. The reversal of 202400440223 is 322044004202.
202400440223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 202400440223 - 22 = 202400440219 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202400440213) 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 in 5 ways as a sum of consecutive naturals, for example, 60200711 + ... + 60204072.
It is an arithmetic number, because the mean of its divisors is an integer number (34576240472).
Almost surely, 2202400440223 is an apocalyptic number.
202400440223 is a deficient number, since it is larger than the sum of its proper divisors (5057002609).
202400440223 is an equidigital number, since it uses as much as digits as its factorization.
202400440223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120404865 (or 120404824 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 23.
Adding to 202400440223 its reverse (322044004202), we get a palindrome (524444444425).
The spelling of 202400440223 in words is "two hundred two billion, four hundred million, four hundred forty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •