Base | Representation |
---|---|
bin | 101111111110000010… |
… | …1000100001100011101 |
3 | 100211220011221122202121 |
4 | 1133330011010030131 |
5 | 3141432414343031 |
6 | 115153531222541 |
7 | 10304524512532 |
oct | 1377405041435 |
9 | 324804848677 |
10 | 103013434141 |
11 | 3a762441842 |
12 | 17b6aba7a51 |
13 | 9938c18977 |
14 | 4db3362d89 |
15 | 2a2da84011 |
hex | 17fc14431d |
103013434141 has 12 divisors (see below), whose sum is σ = 109734423840. Its totient is φ = 96683656640.
The previous prime is 103013434133. The next prime is 103013434163. The reversal of 103013434141 is 141434310301.
It is a happy number.
It is not a de Polignac number, because 103013434141 - 23 = 103013434133 is a prime.
It is a super-2 number, since 2×1030134341412 (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 (103013434441) 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 11 ways as a sum of consecutive naturals, for example, 392695 + ... + 600196.
It is an arithmetic number, because the mean of its divisors is an integer number (9144535320).
Almost surely, 2103013434141 is an apocalyptic number.
It is an amenable number.
103013434141 is a deficient number, since it is larger than the sum of its proper divisors (6720989699).
103013434141 is an equidigital number, since it uses as much as digits as its factorization.
103013434141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 993284 (or 993267 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 103013434141 its reverse (141434310301), we get a palindrome (244447744442).
The spelling of 103013434141 in words is "one hundred three billion, thirteen million, four hundred thirty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •