Base | Representation |
---|---|
bin | 110000000100010101… |
… | …0101110011100101011 |
3 | 100212102220100200022102 |
4 | 1200020222232130223 |
5 | 3142401001230011 |
6 | 115230514044015 |
7 | 10313000622164 |
oct | 1401052563453 |
9 | 325386320272 |
10 | 103224633131 |
11 | 3a860683764 |
12 | 1800987960b |
13 | 99708c4499 |
14 | 4dd341c76b |
15 | 2a423a173b |
hex | 1808aae72b |
103224633131 has 8 divisors (see below), whose sum is σ = 109479146400. Its totient is φ = 96990395008.
The previous prime is 103224633119. The next prime is 103224633137. The reversal of 103224633131 is 131336422301.
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 103224633131 - 26 = 103224633067 is a prime.
It is a super-2 number, since 2×1032246331312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103224633094 and 103224633103.
It is not an unprimeable number, because it can be changed into a prime (103224633137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5058296 + ... + 5078661.
It is an arithmetic number, because the mean of its divisors is an integer number (13684893300).
Almost surely, 2103224633131 is an apocalyptic number.
103224633131 is a deficient number, since it is larger than the sum of its proper divisors (6254513269).
103224633131 is a wasteful number, since it uses less digits than its factorization.
103224633131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10137573.
The product of its (nonzero) digits is 7776, while the sum is 29.
The spelling of 103224633131 in words is "one hundred three billion, two hundred twenty-four million, six hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •