Base | Representation |
---|---|
bin | 101111111110001111… |
… | …1010000101011010101 |
3 | 100211220122212112100012 |
4 | 1133330133100223111 |
5 | 3141441144113023 |
6 | 115154334330005 |
7 | 10304640052550 |
oct | 1377437205325 |
9 | 324818775305 |
10 | 103020301013 |
11 | 3a766301a43 |
12 | 17b71359905 |
13 | 993a4813c6 |
14 | 4db422d697 |
15 | 2a2e48d978 |
hex | 17fc7d0ad5 |
103020301013 has 16 divisors (see below), whose sum is σ = 117962417664. Its totient is φ = 88134547200.
The previous prime is 103020300967. The next prime is 103020301031. The reversal of 103020301013 is 310103020301.
It is not a de Polignac number, because 103020301013 - 232 = 98725333717 is a prime.
It is a super-2 number, since 2×1030203010132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103020301513) 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 15 ways as a sum of consecutive naturals, for example, 14211956 + ... + 14219202.
It is an arithmetic number, because the mean of its divisors is an integer number (7372651104).
Almost surely, 2103020301013 is an apocalyptic number.
It is an amenable number.
103020301013 is a deficient number, since it is larger than the sum of its proper divisors (14942116651).
103020301013 is an equidigital number, since it uses as much as digits as its factorization.
103020301013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10852.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 103020301013 its reverse (310103020301), we get a palindrome (413123321314).
The spelling of 103020301013 in words is "one hundred three billion, twenty million, three hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •