Base | Representation |
---|---|
bin | 101111100110011011… |
… | …1000000100010110110 |
3 | 100202211222021000021221 |
4 | 1133030313000202312 |
5 | 3133322113020042 |
6 | 114543151300554 |
7 | 10246065014425 |
oct | 1371467004266 |
9 | 322758230257 |
10 | 102221220022 |
11 | 3a396239629 |
12 | 1798981a75a |
13 | 9840a6090c |
14 | 4d3a0632bc |
15 | 29d4248d67 |
hex | 17ccdc08b6 |
102221220022 has 16 divisors (see below), whose sum is σ = 155763352800. Its totient is φ = 50306313600.
The previous prime is 102221220001. The next prime is 102221220029. The reversal of 102221220022 is 220022122201.
It is a super-2 number, since 2×1022212200222 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102221219978 and 102221220005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102221220029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1519747 + ... + 1585582.
It is an arithmetic number, because the mean of its divisors is an integer number (9735209550).
Almost surely, 2102221220022 is an apocalyptic number.
102221220022 is a deficient number, since it is larger than the sum of its proper divisors (53542132778).
102221220022 is a wasteful number, since it uses less digits than its factorization.
102221220022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3105591.
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 102221220022 its reverse (220022122201), we get a palindrome (322243342223).
The spelling of 102221220022 in words is "one hundred two billion, two hundred twenty-one million, two hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •