Base | Representation |
---|---|
bin | 110000000110100111… |
… | …0000111101010011111 |
3 | 100212122020002112211112 |
4 | 1200031032013222133 |
5 | 3143030030122234 |
6 | 115242243212235 |
7 | 10314616120310 |
oct | 1401516075237 |
9 | 325566075745 |
10 | 103301020319 |
11 | 3a89a807572 |
12 | 1802b37707b |
13 | 998368b2c3 |
14 | 4ddd624607 |
15 | 2a48e3eace |
hex | 180d387a9f |
103301020319 has 8 divisors (see below), whose sum is σ = 125002915488. Its totient is φ = 83335276800.
The previous prime is 103301020301. The next prime is 103301020327. The reversal of 103301020319 is 913020103301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103301020319 is a prime.
It is a super-2 number, since 2×1033010203192 (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 = 103301020294 and 103301020303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103301020369) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 434037782 + ... + 434038019.
It is an arithmetic number, because the mean of its divisors is an integer number (15625364436).
Almost surely, 2103301020319 is an apocalyptic number.
103301020319 is a deficient number, since it is larger than the sum of its proper divisors (21701895169).
103301020319 is an equidigital number, since it uses as much as digits as its factorization.
103301020319 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 868075825.
The product of its (nonzero) digits is 486, while the sum is 23.
The spelling of 103301020319 in words is "one hundred three billion, three hundred one million, twenty thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •