Base | Representation |
---|---|
bin | 111100001010001100011… |
… | …011000001000101100111 |
3 | 112122012212112122201021201 |
4 | 330022030123001011213 |
5 | 1020213131243300320 |
6 | 12443104055423331 |
7 | 604452131603110 |
oct | 74121433010547 |
9 | 15565775581251 |
10 | 4134114431335 |
11 | 13542a4902979 |
12 | 569276684b47 |
13 | 23cacb219005 |
14 | 104141029207 |
15 | 7281014970a |
hex | 3c28c6c1167 |
4134114431335 has 8 divisors (see below), whose sum is σ = 5669642648736. Its totient is φ = 2834821324320.
The previous prime is 4134114431287. The next prime is 4134114431437. The reversal of 4134114431335 is 5331344114314.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4134114431335 - 225 = 4134080876903 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4134114431294 and 4134114431303.
It is a congruent number.
It is an unprimeable number.
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, 59058777556 + ... + 59058777625.
It is an arithmetic number, because the mean of its divisors is an integer number (708705331092).
Almost surely, 24134114431335 is an apocalyptic number.
4134114431335 is a deficient number, since it is larger than the sum of its proper divisors (1535528217401).
4134114431335 is a wasteful number, since it uses less digits than its factorization.
4134114431335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118117555193.
The product of its digits is 103680, while the sum is 37.
Adding to 4134114431335 its reverse (5331344114314), we get a palindrome (9465458545649).
The spelling of 4134114431335 in words is "four trillion, one hundred thirty-four billion, one hundred fourteen million, four hundred thirty-one thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •