Base | Representation |
---|---|
bin | 11111110111101011… |
… | …011010100010110101 |
3 | 10021022212012102122122 |
4 | 133313223122202311 |
5 | 1030040322434331 |
6 | 23415344005325 |
7 | 2321002154234 |
oct | 376753324265 |
9 | 107285172578 |
10 | 34220124341 |
11 | 135704059a7 |
12 | 6770300845 |
13 | 32c47989b0 |
14 | 1928adcb1b |
15 | d5438117b |
hex | 7f7ada8b5 |
34220124341 has 8 divisors (see below), whose sum is σ = 37058323680. Its totient is φ = 31411336752.
The previous prime is 34220124299. The next prime is 34220124353. The reversal of 34220124341 is 14342102243.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 34220124341 - 26 = 34220124277 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 34220124341.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34220124941) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7350515 + ... + 7355168.
It is an arithmetic number, because the mean of its divisors is an integer number (4632290460).
Almost surely, 234220124341 is an apocalyptic number.
It is an amenable number.
34220124341 is a deficient number, since it is larger than the sum of its proper divisors (2838199339).
34220124341 is a wasteful number, since it uses less digits than its factorization.
34220124341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14705875.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 34220124341 its reverse (14342102243), we get a palindrome (48562226584).
The spelling of 34220124341 in words is "thirty-four billion, two hundred twenty million, one hundred twenty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •