Base | Representation |
---|---|
bin | 101111111110100110… |
… | …0101110100111011010 |
3 | 100211221111022002021200 |
4 | 1133331030232213122 |
5 | 3142002222020442 |
6 | 115155442015030 |
7 | 10305143264256 |
oct | 1377514564732 |
9 | 324844262250 |
10 | 103032220122 |
11 | 3a772002a47 |
12 | 17b75347476 |
13 | 993ca95630 |
14 | 4db5a53266 |
15 | 2a3054534c |
hex | 17fd32e9da |
103032220122 has 48 divisors (see below), whose sum is σ = 243451703040. Its totient is φ = 31300922016.
The previous prime is 103032220121. The next prime is 103032220141. The reversal of 103032220122 is 221022230301.
103032220122 is digitally balanced in base 3 and base 7, because in such bases it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 103032220095 and 103032220104.
It is not an unprimeable number, because it can be changed into a prime (103032220121) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2768278 + ... + 2805249.
It is an arithmetic number, because the mean of its divisors is an integer number (5071910480).
Almost surely, 2103032220122 is an apocalyptic number.
103032220122 is an abundant number, since it is smaller than the sum of its proper divisors (140419482918).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103032220122 is a wasteful number, since it uses less digits than its factorization.
103032220122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5573627 (or 5573624 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 103032220122 its reverse (221022230301), we get a palindrome (324054450423).
The spelling of 103032220122 in words is "one hundred three billion, thirty-two million, two hundred twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •