Base | Representation |
---|---|
bin | 110000100010101110… |
… | …0010001110111100111 |
3 | 100222001221221220020221 |
4 | 1201011130101313213 |
5 | 3201443012144411 |
6 | 115520020105211 |
7 | 10350161362243 |
oct | 1410534216747 |
9 | 328057856227 |
10 | 104244256231 |
11 | 4023418a685 |
12 | 18253235207 |
13 | 9aa3c1236b |
14 | 508c9d7423 |
15 | 2aa1b5c071 |
hex | 1845711de7 |
104244256231 has 8 divisors (see below), whose sum is σ = 105799436064. Its totient is φ = 102691491840.
The previous prime is 104244256229. The next prime is 104244256243. The reversal of 104244256231 is 132652442401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 104244256231 - 21 = 104244256229 is a prime.
It is a super-2 number, since 2×1042442562312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104244256261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 516810 + ... + 689623.
It is an arithmetic number, because the mean of its divisors is an integer number (13224929508).
Almost surely, 2104244256231 is an apocalyptic number.
104244256231 is a deficient number, since it is larger than the sum of its proper divisors (1555179833).
104244256231 is a wasteful number, since it uses less digits than its factorization.
104244256231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1207721.
The product of its (nonzero) digits is 46080, while the sum is 34.
Adding to 104244256231 its reverse (132652442401), we get a palindrome (236896698632).
The spelling of 104244256231 in words is "one hundred four billion, two hundred forty-four million, two hundred fifty-six thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •