Base | Representation |
---|---|
bin | 101111111111011110… |
… | …0100010111000111100 |
3 | 100212000112110021220221 |
4 | 1133332330202320330 |
5 | 3142032223012340 |
6 | 115202410151124 |
7 | 10305650366263 |
oct | 1377674427074 |
9 | 325015407827 |
10 | 103061532220 |
11 | 3a787603619 |
12 | 17b831224a4 |
13 | 9945b8947a |
14 | 4db98c35da |
15 | 2a32dd544a |
hex | 17fef22e3c |
103061532220 has 12 divisors (see below), whose sum is σ = 216429217704. Its totient is φ = 41224612880.
The previous prime is 103061532149. The next prime is 103061532227. The reversal of 103061532220 is 22235160301.
103061532220 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103061532227) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2576538286 + ... + 2576538325.
It is an arithmetic number, because the mean of its divisors is an integer number (18035768142).
Almost surely, 2103061532220 is an apocalyptic number.
103061532220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103061532220 is an abundant number, since it is smaller than the sum of its proper divisors (113367685484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103061532220 is a wasteful number, since it uses less digits than its factorization.
103061532220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5153076620 (or 5153076618 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 103061532220 its reverse (22235160301), we get a palindrome (125296692521).
The spelling of 103061532220 in words is "one hundred three billion, sixty-one million, five hundred thirty-two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •