Base | Representation |
---|---|
bin | 101111111110000010… |
… | …0010000001101011101 |
3 | 100211220011112211200101 |
4 | 1133330010100031131 |
5 | 3141432341034323 |
6 | 115153522501101 |
7 | 10304522635000 |
oct | 1377404201535 |
9 | 324804484611 |
10 | 103013221213 |
11 | 3a762306871 |
12 | 17b6ab04791 |
13 | 9938b72a86 |
14 | 4db3309537 |
15 | 2a2da40dad |
hex | 17fc11035d |
103013221213 has 16 divisors (see below), whose sum is σ = 120927673600. Its totient is φ = 87712254000.
The previous prime is 103013221193. The next prime is 103013221279. The reversal of 103013221213 is 312122310301.
It is not a de Polignac number, because 103013221213 - 221 = 103011124061 is a prime.
It is a super-2 number, since 2×1030132212132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103013021213) 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 15 ways as a sum of consecutive naturals, for example, 942678 + ... + 1046263.
It is an arithmetic number, because the mean of its divisors is an integer number (7557979600).
Almost surely, 2103013221213 is an apocalyptic number.
It is an amenable number.
103013221213 is a deficient number, since it is larger than the sum of its proper divisors (17914452387).
103013221213 is an equidigital number, since it uses as much as digits as its factorization.
103013221213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1989113 (or 1989099 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 103013221213 its reverse (312122310301), we get a palindrome (415135531514).
The spelling of 103013221213 in words is "one hundred three billion, thirteen million, two hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •