Base | Representation |
---|---|
bin | 11001000011101001100111… |
… | …101011000011100111011100 |
3 | 112110012012122120102021102212 |
4 | 121003221213223003213130 |
5 | 103421022204104033040 |
6 | 1030214034331535552 |
7 | 32132555355205334 |
oct | 3103514753034734 |
9 | 473165576367385 |
10 | 110202010221020 |
11 | 3212845689a183 |
12 | 10439a7a2ba5b8 |
13 | 496500ac06013 |
14 | 1d2db3cdbc0c4 |
15 | cb19193b7d65 |
hex | 643a67ac39dc |
110202010221020 has 36 divisors (see below), whose sum is σ = 241923619058520. Its totient is φ = 42164247384864.
The previous prime is 110202010221013. The next prime is 110202010221029. The reversal of 110202010221020 is 20122010202011.
It is a junction number, because it is equal to n+sod(n) for n = 110202010220986 and 110202010221004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110202010221029) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5208023930 + ... + 5208045089.
Almost surely, 2110202010221020 is an apocalyptic number.
110202010221020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110202010221020 is an abundant number, since it is smaller than the sum of its proper divisors (131721608837500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110202010221020 is a wasteful number, since it uses less digits than its factorization.
110202010221020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10416069074 (or 10416069049 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 110202010221020 its reverse (20122010202011), we get a palindrome (130324020423031).
The spelling of 110202010221020 in words is "one hundred ten trillion, two hundred two billion, ten million, two hundred twenty-one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •