Base | Representation |
---|---|
bin | 111110011010010010… |
… | …1001000100111101001 |
3 | 110210221111211010222111 |
4 | 1330310211020213221 |
5 | 4143441142323131 |
6 | 141323141122321 |
7 | 12453202234210 |
oct | 1746445104751 |
9 | 423844733874 |
10 | 134026136041 |
11 | 51927294796 |
12 | 21b850b93a1 |
13 | c83c047555 |
14 | 66b60a4077 |
15 | 374654cab1 |
hex | 1f349489e9 |
134026136041 has 8 divisors (see below), whose sum is σ = 153208607744. Its totient is φ = 114852634560.
The previous prime is 134026136011. The next prime is 134026136087. The reversal of 134026136041 is 140631620431.
It is a happy number.
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 134026136041 - 27 = 134026135913 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 134026135994 and 134026136012.
It is not an unprimeable number, because it can be changed into a prime (134026136011) 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, 2210505 + ... + 2270326.
It is an arithmetic number, because the mean of its divisors is an integer number (19151075968).
Almost surely, 2134026136041 is an apocalyptic number.
It is an amenable number.
134026136041 is a deficient number, since it is larger than the sum of its proper divisors (19182471703).
134026136041 is an equidigital number, since it uses as much as digits as its factorization.
134026136041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4485111.
The product of its (nonzero) digits is 10368, while the sum is 31.
Adding to 134026136041 its reverse (140631620431), we get a palindrome (274657756472).
The spelling of 134026136041 in words is "one hundred thirty-four billion, twenty-six million, one hundred thirty-six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •