Base | Representation |
---|---|
bin | 101111111110001111… |
… | …1010101111000010001 |
3 | 100211220122220121120101 |
4 | 1133330133111320101 |
5 | 3141441200303241 |
6 | 115154335012401 |
7 | 10304640201640 |
oct | 1377437257021 |
9 | 324818817511 |
10 | 103020322321 |
11 | 3a766316a54 |
12 | 17b7136a101 |
13 | 993a48b007 |
14 | 4db4237357 |
15 | 2a2e494e31 |
hex | 17fc7d5e11 |
103020322321 has 8 divisors (see below), whose sum is σ = 117890622080. Its totient is φ = 88188300288.
The previous prime is 103020322309. The next prime is 103020322331. The reversal of 103020322321 is 123223020301.
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 103020322321 - 25 = 103020322289 is a prime.
It is a super-2 number, since 2×1030203223212 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103020322331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9563661 + ... + 9574426.
It is an arithmetic number, because the mean of its divisors is an integer number (14736327760).
Almost surely, 2103020322321 is an apocalyptic number.
It is an amenable number.
103020322321 is a deficient number, since it is larger than the sum of its proper divisors (14870299759).
103020322321 is an equidigital number, since it uses as much as digits as its factorization.
103020322321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19138863.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 103020322321 its reverse (123223020301), we get a palindrome (226243342622).
The spelling of 103020322321 in words is "one hundred three billion, twenty million, three hundred twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •