Base | Representation |
---|---|
bin | 101111111110111011… |
… | …0001111001011110111 |
3 | 100211222020202220122010 |
4 | 1133331312033023313 |
5 | 3142013013221211 |
6 | 115200511135303 |
7 | 10305334624224 |
oct | 1377566171367 |
9 | 324866686563 |
10 | 103043101431 |
11 | 3a778165266 |
12 | 17b78b14533 |
13 | 994210538a |
14 | 4db728694b |
15 | 2a314944a6 |
hex | 17fdd8f2f7 |
103043101431 has 8 divisors (see below), whose sum is σ = 139643110384. Its totient is φ = 67569246720.
The previous prime is 103043101387. The next prime is 103043101507. The reversal of 103043101431 is 134101340301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103043101431 - 27 = 103043101303 is a prime.
It is a super-2 number, since 2×1030431014312 (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 = 103043101398 and 103043101407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103043101331) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 281538346 + ... + 281538711.
It is an arithmetic number, because the mean of its divisors is an integer number (17455388798).
Almost surely, 2103043101431 is an apocalyptic number.
103043101431 is a deficient number, since it is larger than the sum of its proper divisors (36600008953).
103043101431 is an equidigital number, since it uses as much as digits as its factorization.
103043101431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 563077121.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 103043101431 its reverse (134101340301), we get a palindrome (237144441732).
The spelling of 103043101431 in words is "one hundred three billion, forty-three million, one hundred one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •