Base | Representation |
---|---|
bin | 110000011100101100… |
… | …0110110110010110110 |
3 | 100221112212102212012002 |
4 | 1200321120312302312 |
5 | 3201034230013220 |
6 | 115443553455302 |
7 | 10342154453156 |
oct | 1407130666266 |
9 | 327485385162 |
10 | 104042032310 |
11 | 40140018877 |
12 | 181b7571532 |
13 | 9a71059a38 |
14 | 506dbd6766 |
15 | 2a8e013c75 |
hex | 1839636cb6 |
104042032310 has 16 divisors (see below), whose sum is σ = 187295744016. Its totient is φ = 41612349408.
The previous prime is 104042032301. The next prime is 104042032319. The reversal of 104042032310 is 13230240401.
It is an interprime number because it is at equal distance from previous prime (104042032301) and next prime (104042032319).
It is a super-2 number, since 2×1040420323102 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104042032319) 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, 459209 + ... + 647268.
It is an arithmetic number, because the mean of its divisors is an integer number (11705984001).
Almost surely, 2104042032310 is an apocalyptic number.
104042032310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
104042032310 is a deficient number, since it is larger than the sum of its proper divisors (83253711706).
104042032310 is a wasteful number, since it uses less digits than its factorization.
104042032310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1115887.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 104042032310 its reverse (13230240401), we get a palindrome (117272272711).
The spelling of 104042032310 in words is "one hundred four billion, forty-two million, thirty-two thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •