Base | Representation |
---|---|
bin | 110000000111110001… |
… | …1101101000110100010 |
3 | 100212201221212202200120 |
4 | 1200033203231012202 |
5 | 3143120044424442 |
6 | 115250203501110 |
7 | 10315603326330 |
oct | 1401743550642 |
9 | 325657782616 |
10 | 103340233122 |
11 | 3a90a95a745 |
12 | 18040527796 |
13 | 998b83a749 |
14 | 5004910b50 |
15 | 2a4c5d84ec |
hex | 180f8ed1a2 |
103340233122 has 128 divisors (see below), whose sum is σ = 259733606400. Its totient is φ = 26726236416.
The previous prime is 103340233093. The next prime is 103340233133. The reversal of 103340233122 is 221332043301.
It is a junction number, because it is equal to n+sod(n) for n = 103340233092 and 103340233101.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 20352048 + ... + 20357124.
It is an arithmetic number, because the mean of its divisors is an integer number (2029168800).
Almost surely, 2103340233122 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 103340233122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (129866803200).
103340233122 is an abundant number, since it is smaller than the sum of its proper divisors (156393373278).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103340233122 is a wasteful number, since it uses less digits than its factorization.
103340233122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6240.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 103340233122 its reverse (221332043301), we get a palindrome (324672276423).
The spelling of 103340233122 in words is "one hundred three billion, three hundred forty million, two hundred thirty-three thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •