Base | Representation |
---|---|
bin | 101101111101010000111110… |
… | …101101010101001010101100 |
3 | 222111122200202112211121012221 |
4 | 231331100332231111022230 |
5 | 202443032243013122312 |
6 | 1553513355055405124 |
7 | 60400563601333363 |
oct | 5575207655251254 |
9 | 874580675747187 |
10 | 202122213020332 |
11 | 59447604a31180 |
12 | 1a8047802237a4 |
13 | 88a207334a4a7 |
14 | 37caaa56c67da |
15 | 18579e1462207 |
hex | b7d43eb552ac |
202122213020332 has 48 divisors (see below), whose sum is σ = 388165180112640. Its totient is φ = 91328800040000.
The previous prime is 202122213020309. The next prime is 202122213020339. The reversal of 202122213020332 is 233020312221202.
It is a junction number, because it is equal to n+sod(n) for n = 202122213020297 and 202122213020306.
It is not an unprimeable number, because it can be changed into a prime (202122213020339) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15175294 + ... + 25189957.
It is an arithmetic number, because the mean of its divisors is an integer number (8086774585680).
Almost surely, 2202122213020332 is an apocalyptic number.
202122213020332 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
202122213020332 is a deficient number, since it is larger than the sum of its proper divisors (186042967092308).
202122213020332 is a wasteful number, since it uses less digits than its factorization.
202122213020332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40365942 (or 40365940 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 202122213020332 its reverse (233020312221202), we get a palindrome (435142525241534).
The spelling of 202122213020332 in words is "two hundred two trillion, one hundred twenty-two billion, two hundred thirteen million, twenty thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •