Base | Representation |
---|---|
bin | 101101111011110001111111… |
… | …011101101000110000101100 |
3 | 222111021221111111101000102022 |
4 | 231323301333131220300230 |
5 | 202434344402333211340 |
6 | 1553354450303445312 |
7 | 60360323245630016 |
oct | 5573617735506054 |
9 | 874257444330368 |
10 | 202020220210220 |
11 | 5940832671a375 |
12 | 1a7a8a56bb6838 |
13 | 889556aa10189 |
14 | 37c5b8bb1d1b6 |
15 | 18550222d53b5 |
hex | b7bc7f768c2c |
202020220210220 has 48 divisors (see below), whose sum is σ = 427098984006240. Its totient is φ = 80265018269184.
The previous prime is 202020220210213. The next prime is 202020220210231. The reversal of 202020220210220 is 22012022020202.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29032649 + ... + 35311968.
It is an arithmetic number, because the mean of its divisors is an integer number (8897895500130).
Almost surely, 2202020220210220 is an apocalyptic number.
202020220210220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
202020220210220 is an abundant number, since it is smaller than the sum of its proper divisors (225078763796020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202020220210220 is a wasteful number, since it uses less digits than its factorization.
202020220210220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64345682 (or 64345680 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 17.
Adding to 202020220210220 its reverse (22012022020202), we get a palindrome (224032242230422).
The spelling of 202020220210220 in words is "two hundred two trillion, twenty billion, two hundred twenty million, two hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •