Base | Representation |
---|---|
bin | 110000100010000010… |
… | …0101110011000010111 |
3 | 100222000100202211012000 |
4 | 1201010010232120113 |
5 | 3201421123214333 |
6 | 115513440130343 |
7 | 10346462320152 |
oct | 1410404563027 |
9 | 328010684160 |
10 | 104221304343 |
11 | 40222233582 |
12 | 182476069b3 |
13 | 9a9c237470 |
14 | 5089940c99 |
15 | 2a9eb26713 |
hex | 184412e617 |
104221304343 has 64 divisors (see below), whose sum is σ = 168591360000. Its totient is φ = 63246313728.
The previous prime is 104221304339. The next prime is 104221304351. The reversal of 104221304343 is 343403122401.
104221304343 is a `hidden beast` number, since 1 + 0 + 4 + 221 + 3 + 0 + 434 + 3 = 666.
It is not a de Polignac number, because 104221304343 - 22 = 104221304339 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104221304323) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 29085930 + ... + 29089512.
It is an arithmetic number, because the mean of its divisors is an integer number (2634240000).
Almost surely, 2104221304343 is an apocalyptic number.
104221304343 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
104221304343 is a deficient number, since it is larger than the sum of its proper divisors (64370055657).
104221304343 is a wasteful number, since it uses less digits than its factorization.
104221304343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4733 (or 4727 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 104221304343 its reverse (343403122401), we get a palindrome (447624426744).
The spelling of 104221304343 in words is "one hundred four billion, two hundred twenty-one million, three hundred four thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •