Base | Representation |
---|---|
bin | 110000001001101101… |
… | …1101100101100000110 |
3 | 100212220111012121200002 |
4 | 1200103123230230012 |
5 | 3143233220240032 |
6 | 115300445121302 |
7 | 10320323031035 |
oct | 1402333545406 |
9 | 325814177602 |
10 | 103405243142 |
11 | 3a943622733 |
12 | 1805a259232 |
13 | 999c14cc06 |
14 | 500d3d471c |
15 | 2a5317a862 |
hex | 18136ecb06 |
103405243142 has 8 divisors (see below), whose sum is σ = 163271436600. Its totient is φ = 48981430944.
The previous prime is 103405243129. The next prime is 103405243147. The reversal of 103405243142 is 241342504301.
103405243142 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1034052431422 (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 (103405243147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1360595267 + ... + 1360595342.
It is an arithmetic number, because the mean of its divisors is an integer number (20408929575).
Almost surely, 2103405243142 is an apocalyptic number.
103405243142 is a deficient number, since it is larger than the sum of its proper divisors (59866193458).
103405243142 is a wasteful number, since it uses less digits than its factorization.
103405243142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2721190630.
The product of its (nonzero) digits is 11520, while the sum is 29.
Adding to 103405243142 its reverse (241342504301), we get a palindrome (344747747443).
The spelling of 103405243142 in words is "one hundred three billion, four hundred five million, two hundred forty-three thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •