Base | Representation |
---|---|
bin | 101101111011110001111111… |
… | …011101010000110010000000 |
3 | 222111021221111111012000200112 |
4 | 231323301333131100302000 |
5 | 202434344402322041000 |
6 | 1553354450301410452 |
7 | 60360323245040453 |
oct | 5573617735206200 |
9 | 874257444160615 |
10 | 202020220112000 |
11 | 594083266625a4 |
12 | 1a7a8a56b69a28 |
13 | 889556a9a7564 |
14 | 37c5b8bad549a |
15 | 18550222b6235 |
hex | b7bc7f750c80 |
202020220112000 has 64 divisors (see below), whose sum is σ = 502272772293240. Its totient is φ = 80808088038400.
The previous prime is 202020220111961. The next prime is 202020220112023. The reversal of 202020220112000 is 211022020202.
It can be written as a sum of positive squares in 4 ways, for example, as 103418974318144 + 98601245793856 = 10169512^2 + 9929816^2 .
It is a tau number, because it is divible by the number of its divisors (64).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6313115879 + ... + 6313147878.
Almost surely, 2202020220112000 is an apocalyptic number.
202020220112000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
202020220112000 is an abundant number, since it is smaller than the sum of its proper divisors (300252552181240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202020220112000 is an equidigital number, since it uses as much as digits as its factorization.
202020220112000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12626263786 (or 12626263764 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 202020220112000 its reverse (211022020202), we get a palindrome (202231242132202).
The spelling of 202020220112000 in words is "two hundred two trillion, twenty billion, two hundred twenty million, one hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •