Base | Representation |
---|---|
bin | 101101111100000110100100… |
… | …001100110101111011110000 |
3 | 222111101001112001211210101211 |
4 | 231330012210030311323300 |
5 | 202440230123204314300 |
6 | 1553412542334405504 |
7 | 60362034552641434 |
oct | 5574064414657360 |
9 | 874331461753354 |
10 | 202042311401200 |
11 | 594167326100a6 |
12 | 1a7b11a1360894 |
13 | 889767b71020a |
14 | 37c6c85a3a9c4 |
15 | 18558b69284ba |
hex | b7c1a4335ef0 |
202042311401200 has 60 divisors (see below), whose sum is σ = 485412828543720. Its totient is φ = 80815896398080.
The previous prime is 202042311401171. The next prime is 202042311401243. The reversal of 202042311401200 is 2104113240202.
It is a super-2 number, since 2×2020423114012002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 28662387 + ... + 35008813.
It is an arithmetic number, because the mean of its divisors is an integer number (8090213809062).
Almost surely, 2202042311401200 is an apocalyptic number.
202042311401200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
202042311401200 is an abundant number, since it is smaller than the sum of its proper divisors (283370517142520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202042311401200 is a wasteful number, since it uses less digits than its factorization.
202042311401200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6426034 (or 6426023 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 202042311401200 its reverse (2104113240202), we get a palindrome (204146424641402).
The spelling of 202042311401200 in words is "two hundred two trillion, forty-two billion, three hundred eleven million, four hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •