Base | Representation |
---|---|
bin | 110000100101000100… |
… | …0101100111111101101 |
3 | 100222021110011000212020 |
4 | 1201022020230333231 |
5 | 3202123142314131 |
6 | 115531512100353 |
7 | 10352135646531 |
oct | 1411210547755 |
9 | 328243130766 |
10 | 104323010541 |
11 | 4027468a992 |
12 | 182756946b9 |
13 | 9ab7327749 |
14 | 5099257bc1 |
15 | 2aa8a16996 |
hex | 184a22cfed |
104323010541 has 8 divisors (see below), whose sum is σ = 145145058240. Its totient is φ = 66524818272.
The previous prime is 104323010501. The next prime is 104323010551. The reversal of 104323010541 is 145010323401.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-104323010541 is a prime.
It is a super-2 number, since 2×1043230105412 (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 (104323010501) 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, 755963776 + ... + 755963913.
It is an arithmetic number, because the mean of its divisors is an integer number (18143132280).
Almost surely, 2104323010541 is an apocalyptic number.
It is an amenable number.
104323010541 is a deficient number, since it is larger than the sum of its proper divisors (40822047699).
104323010541 is a wasteful number, since it uses less digits than its factorization.
104323010541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1511927715.
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 104323010541 its reverse (145010323401), we get a palindrome (249333333942).
The spelling of 104323010541 in words is "one hundred four billion, three hundred twenty-three million, ten thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •