Base | Representation |
---|---|
bin | 101111111110100100… |
… | …1010000101100010010 |
3 | 100211221102120220101000 |
4 | 1133331021100230102 |
5 | 3142002003423442 |
6 | 115155410322430 |
7 | 10305132460155 |
oct | 1377511205422 |
9 | 324842526330 |
10 | 103031311122 |
11 | 3a771542003 |
12 | 17b74b89416 |
13 | 993c83796c |
14 | 4db5897c9c |
15 | 2a30415d4c |
hex | 17fd250b12 |
103031311122 has 16 divisors (see below), whose sum is σ = 228958469280. Its totient is φ = 34343770356.
The previous prime is 103031311067. The next prime is 103031311177. The reversal of 103031311122 is 221113130301.
It is an interprime number because it is at equal distance from previous prime (103031311067) and next prime (103031311177).
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 = 103031311095 and 103031311104.
It is an unprimeable number.
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, 953993568 + ... + 953993675.
It is an arithmetic number, because the mean of its divisors is an integer number (14309904330).
Almost surely, 2103031311122 is an apocalyptic number.
103031311122 is an abundant number, since it is smaller than the sum of its proper divisors (125927158158).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103031311122 is a wasteful number, since it uses less digits than its factorization.
103031311122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1907987254 (or 1907987248 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 103031311122 its reverse (221113130301), we get a palindrome (324144441423).
The spelling of 103031311122 in words is "one hundred three billion, thirty-one million, three hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •