Base | Representation |
---|---|
bin | 110111111110010101… |
… | …0111010000010110100 |
3 | 102111021011120102100101 |
4 | 1233330222322002310 |
5 | 3432134011120340 |
6 | 131115352123444 |
7 | 11453514352633 |
oct | 1577452720264 |
9 | 374234512311 |
10 | 120203223220 |
11 | 46a836497a3 |
12 | 1b367996584 |
13 | b44832c7b2 |
14 | 5b6432751a |
15 | 31d7c49c9a |
hex | 1bfcaba0b4 |
120203223220 has 12 divisors (see below), whose sum is σ = 252426768804. Its totient is φ = 48081289280.
The previous prime is 120203223211. The next prime is 120203223221. The reversal of 120203223220 is 22322302021.
It can be written as a sum of positive squares in 2 ways, for example, as 34862117796 + 85341105424 = 186714^2 + 292132^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120203223221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3005080561 + ... + 3005080600.
It is an arithmetic number, because the mean of its divisors is an integer number (21035564067).
Almost surely, 2120203223220 is an apocalyptic number.
120203223220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120203223220 is an abundant number, since it is smaller than the sum of its proper divisors (132223545584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120203223220 is a wasteful number, since it uses less digits than its factorization.
120203223220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6010161170 (or 6010161168 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 19.
Adding to 120203223220 its reverse (22322302021), we get a palindrome (142525525241).
The spelling of 120203223220 in words is "one hundred twenty billion, two hundred three million, two hundred twenty-three thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •