Base | Representation |
---|---|
bin | 1100011001100… |
… | …01101000101011 |
3 | 21020201101002120 |
4 | 12030301220223 |
5 | 203111343311 |
6 | 14153202323 |
7 | 2402042643 |
oct | 614615053 |
9 | 236641076 |
10 | 104012331 |
11 | 53792005 |
12 | 2aa003a3 |
13 | 18719b77 |
14 | db57523 |
15 | 91e8706 |
hex | 6331a2b |
104012331 has 4 divisors (see below), whose sum is σ = 138683112. Its totient is φ = 69341552.
The previous prime is 104012317. The next prime is 104012351. The reversal of 104012331 is 133210401.
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 104012331 - 26 = 104012267 is a prime.
It is a super-2 number, since 2×1040123312 = 21637130000107122, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 104012331.
It is not an unprimeable number, because it can be changed into a prime (104012351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17335386 + ... + 17335391.
It is an arithmetic number, because the mean of its divisors is an integer number (34670778).
Almost surely, 2104012331 is an apocalyptic number.
104012331 is a deficient number, since it is larger than the sum of its proper divisors (34670781).
104012331 is an equidigital number, since it uses as much as digits as its factorization.
104012331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34670780.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 104012331 is about 10198.6435862815. The cubic root of 104012331 is about 470.2855229045.
Adding to 104012331 its reverse (133210401), we get a palindrome (237222732).
The spelling of 104012331 in words is "one hundred four million, twelve thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.732 sec. • engine limits •