Base | Representation |
---|---|
bin | 110000100100101110… |
… | …0001100010010010111 |
3 | 100222020122012012221121 |
4 | 1201021130030102113 |
5 | 3202112200422411 |
6 | 115530414024411 |
7 | 10351634531245 |
oct | 1411134142227 |
9 | 328218165847 |
10 | 104311342231 |
11 | 40269040358 |
12 | 182717a8107 |
13 | 9ab4aa0715 |
14 | 509789b795 |
15 | 2aa79ae571 |
hex | 184970c497 |
104311342231 has 4 divisors (see below), whose sum is σ = 104480404992. Its totient is φ = 104142279472.
The previous prime is 104311342171. The next prime is 104311342271. The reversal of 104311342231 is 132243113401.
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 104311342231 - 215 = 104311309463 is a prime.
It is a super-2 number, since 2×1043113422312 (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 = 104311342196 and 104311342205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104311342271) 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, 84530455 + ... + 84531688.
It is an arithmetic number, because the mean of its divisors is an integer number (26120101248).
Almost surely, 2104311342231 is an apocalyptic number.
104311342231 is a deficient number, since it is larger than the sum of its proper divisors (169062761).
104311342231 is an equidigital number, since it uses as much as digits as its factorization.
104311342231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 169062760.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 104311342231 its reverse (132243113401), we get a palindrome (236554455632).
The spelling of 104311342231 in words is "one hundred four billion, three hundred eleven million, three hundred forty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •