Base | Representation |
---|---|
bin | 101111111101111100… |
… | …1001011111111000001 |
3 | 100211212222002110101221 |
4 | 1133323321023333001 |
5 | 3141431120222241 |
6 | 115153340355041 |
7 | 10304456163406 |
oct | 1377371137701 |
9 | 324788073357 |
10 | 103010320321 |
11 | 3a760705337 |
12 | 17b69b45a81 |
13 | 993839857c |
14 | 4db2b922ad |
15 | 2a2d66b5d1 |
hex | 17fbe4bfc1 |
103010320321 has 8 divisors (see below), whose sum is σ = 105230816640. Its totient is φ = 100791023568.
The previous prime is 103010320277. The next prime is 103010320327. The reversal of 103010320321 is 123023010301.
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 103010320321 - 211 = 103010318273 is a prime.
It is a super-2 number, since 2×1030103203212 (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 = 103010320295 and 103010320304.
It is not an unprimeable number, because it can be changed into a prime (103010320327) 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, 125211 + ... + 470848.
It is an arithmetic number, because the mean of its divisors is an integer number (13153852080).
Almost surely, 2103010320321 is an apocalyptic number.
It is an amenable number.
103010320321 is a deficient number, since it is larger than the sum of its proper divisors (2220496319).
103010320321 is an equidigital number, since it uses as much as digits as its factorization.
103010320321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 599783.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 103010320321 its reverse (123023010301), we get a palindrome (226033330622).
The spelling of 103010320321 in words is "one hundred three billion, ten million, three hundred twenty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •