Base | Representation |
---|---|
bin | 110000011110110010… |
… | …0100100110110110111 |
3 | 100221201202111102120212 |
4 | 1200331210210312313 |
5 | 3201210211312211 |
6 | 115454542020035 |
7 | 10343666132642 |
oct | 1407544446667 |
9 | 327652442525 |
10 | 104112213431 |
11 | 401766a29a6 |
12 | 18216b7761b |
13 | 9a8275cb25 |
14 | 5079264a59 |
15 | 2a9527838b |
hex | 183d924db7 |
104112213431 has 8 divisors (see below), whose sum is σ = 104443928160. Its totient is φ = 103780998432.
The previous prime is 104112213427. The next prime is 104112213479. The reversal of 104112213431 is 134312211401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 104112213431 - 22 = 104112213427 is a prime.
It is a super-2 number, since 2×1041122134312 (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 = 104112213397 and 104112213406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104112213131) 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, 294641 + ... + 543173.
It is an arithmetic number, because the mean of its divisors is an integer number (13055491020).
Almost surely, 2104112213431 is an apocalyptic number.
104112213431 is a deficient number, since it is larger than the sum of its proper divisors (331714729).
104112213431 is an equidigital number, since it uses as much as digits as its factorization.
104112213431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 249865.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 104112213431 its reverse (134312211401), we get a palindrome (238424424832).
The spelling of 104112213431 in words is "one hundred four billion, one hundred twelve million, two hundred thirteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •