Base | Representation |
---|---|
bin | 110000000100001111… |
… | …0001000010010111011 |
3 | 100212102200010220211010 |
4 | 1200020132020102323 |
5 | 3142344130044011 |
6 | 115230315205003 |
7 | 10312630560312 |
oct | 1401036102273 |
9 | 325380126733 |
10 | 103221331131 |
11 | 3a859828936 |
12 | 18008746763 |
13 | 9970009539 |
14 | 4dd2bdd279 |
15 | 2a41e4d1a6 |
hex | 18087884bb |
103221331131 has 8 divisors (see below), whose sum is σ = 137676257280. Its totient is φ = 68790312872.
The previous prime is 103221331127. The next prime is 103221331201. The reversal of 103221331131 is 131133122301.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103221331131 - 22 = 103221331127 is a prime.
It is a super-2 number, since 2×1032213311312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103221331098 and 103221331107.
It is not an unprimeable number, because it can be changed into a prime (103221330131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5966895 + ... + 5984168.
It is an arithmetic number, because the mean of its divisors is an integer number (17209532160).
Almost surely, 2103221331131 is an apocalyptic number.
103221331131 is a deficient number, since it is larger than the sum of its proper divisors (34454926149).
103221331131 is a wasteful number, since it uses less digits than its factorization.
103221331131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11953945.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 103221331131 its reverse (131133122301), we get a palindrome (234354453432).
The spelling of 103221331131 in words is "one hundred three billion, two hundred twenty-one million, three hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •