Base | Representation |
---|---|
bin | 110000000001010010… |
… | …0111001100001010001 |
3 | 100212011210001211212121 |
4 | 1200002210321201101 |
5 | 3142143321123241 |
6 | 115212423454241 |
7 | 10310320203613 |
oct | 1400244714121 |
9 | 325153054777 |
10 | 103122442321 |
11 | 3a808a26248 |
12 | 17b9b5b7381 |
13 | 9955694752 |
14 | 4dc3a1adb3 |
15 | 2a38417ad1 |
hex | 1802939851 |
103122442321 has 8 divisors (see below), whose sum is σ = 103286664000. Its totient is φ = 102958270800.
The previous prime is 103122442277. The next prime is 103122442343. The reversal of 103122442321 is 123244221301.
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 103122442321 - 27 = 103122442193 is a prime.
It is a super-2 number, since 2×1031224423212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103122449321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7689580 + ... + 7702978.
It is an arithmetic number, because the mean of its divisors is an integer number (12910833000).
Almost surely, 2103122442321 is an apocalyptic number.
It is an amenable number.
103122442321 is a deficient number, since it is larger than the sum of its proper divisors (164221679).
103122442321 is a wasteful number, since it uses less digits than its factorization.
103122442321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25079.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 103122442321 its reverse (123244221301), we get a palindrome (226366663622).
The spelling of 103122442321 in words is "one hundred three billion, one hundred twenty-two million, four hundred forty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •