Base | Representation |
---|---|
bin | 110000001001101100… |
… | …0100010010010110011 |
3 | 100212220102122111110222 |
4 | 1200103120202102303 |
5 | 3143233012223011 |
6 | 115300415243255 |
7 | 10320313006064 |
oct | 1402330422263 |
9 | 325812574428 |
10 | 103404414131 |
11 | 3a9431068a7 |
12 | 18059b1952b |
13 | 999bc1c785 |
14 | 500d25a56b |
15 | 2a53064ddb |
hex | 18136224b3 |
103404414131 has 4 divisors (see below), whose sum is σ = 105809167992. Its totient is φ = 100999660272.
The previous prime is 103404414109. The next prime is 103404414133. The reversal of 103404414131 is 131414404301.
It is a happy number.
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 103404414131 - 26 = 103404414067 is a prime.
It is a super-2 number, since 2×1034044141312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103404414131.
It is not an unprimeable number, because it can be changed into a prime (103404414133) 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, 1202376866 + ... + 1202376951.
It is an arithmetic number, because the mean of its divisors is an integer number (26452291998).
Almost surely, 2103404414131 is an apocalyptic number.
103404414131 is a deficient number, since it is larger than the sum of its proper divisors (2404753861).
103404414131 is an equidigital number, since it uses as much as digits as its factorization.
103404414131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2404753860.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 103404414131 its reverse (131414404301), we get a palindrome (234818818432).
The spelling of 103404414131 in words is "one hundred three billion, four hundred four million, four hundred fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •