Base | Representation |
---|---|
bin | 1011110001011010100… |
… | …1000111110000001000 |
3 | 201100000200112020020222 |
4 | 2330112221013300020 |
5 | 11303143243410240 |
6 | 232524224405212 |
7 | 20416531015466 |
oct | 2742651076010 |
9 | 640020466228 |
10 | 202243341320 |
11 | 78853103799 |
12 | 33242a76808 |
13 | 160c1017187 |
14 | 9b08001836 |
15 | 53da3a2eb5 |
hex | 2f16a47c08 |
202243341320 has 32 divisors (see below), whose sum is σ = 459552948120. Its totient is φ = 80096371200.
The previous prime is 202243341263. The next prime is 202243341341. The reversal of 202243341320 is 23143342202.
It can be written as a sum of positive squares in 4 ways, for example, as 202152748996 + 90592324 = 449614^2 + 9518^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 202243341320.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25026077 + ... + 25034156.
Almost surely, 2202243341320 is an apocalyptic number.
202243341320 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
202243341320 is an abundant number, since it is smaller than the sum of its proper divisors (257309606800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202243341320 is a wasteful number, since it uses less digits than its factorization.
202243341320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50060345 (or 50060341 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 26.
Adding to 202243341320 its reverse (23143342202), we get a palindrome (225386683522).
The spelling of 202243341320 in words is "two hundred two billion, two hundred forty-three million, three hundred forty-one thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.273 sec. • engine limits •