Base | Representation |
---|---|
bin | 101111111110111011… |
… | …0010100001101101111 |
3 | 100211222020210221220002 |
4 | 1133331312110031233 |
5 | 3142013014401111 |
6 | 115200511414515 |
7 | 10305335041253 |
oct | 1377566241557 |
9 | 324866727802 |
10 | 103043122031 |
11 | 3a778179793 |
12 | 17b78b2443b |
13 | 9942111875 |
14 | 4db7290263 |
15 | 2a3149a63b |
hex | 17fdd9436f |
103043122031 has 4 divisors (see below), whose sum is σ = 104063351064. Its totient is φ = 102022893000.
The previous prime is 103043121947. The next prime is 103043122033. The reversal of 103043122031 is 130221340301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 103043122031 - 214 = 103043105647 is a prime.
It is a super-2 number, since 2×1030431220312 (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 = 103043121994 and 103043122012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103043122033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 510114365 + ... + 510114566.
It is an arithmetic number, because the mean of its divisors is an integer number (26015837766).
Almost surely, 2103043122031 is an apocalyptic number.
103043122031 is a deficient number, since it is larger than the sum of its proper divisors (1020229033).
103043122031 is a wasteful number, since it uses less digits than its factorization.
103043122031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1020229032.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 103043122031 its reverse (130221340301), we get a palindrome (233264462332).
The spelling of 103043122031 in words is "one hundred three billion, forty-three million, one hundred twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •