Base | Representation |
---|---|
bin | 111110100011101011… |
… | …1110110100010011011 |
3 | 110211202111002021221000 |
4 | 1331013113312202123 |
5 | 4200112400434321 |
6 | 141414322520043 |
7 | 12464051145024 |
oct | 1750727664233 |
9 | 424674067830 |
10 | 134341421211 |
11 | 51a79259148 |
12 | 22052806023 |
13 | c88c46771a |
14 | 6705cd5c4b |
15 | 376407a826 |
hex | 1f475f689b |
134341421211 has 64 divisors (see below), whose sum is σ = 209534976000. Its totient is φ = 84904060032.
The previous prime is 134341421173. The next prime is 134341421243. The reversal of 134341421211 is 112124143431.
It is a happy number.
134341421211 is a `hidden beast` number, since 1 + 3 + 434 + 1 + 4 + 212 + 11 = 666.
It is not a de Polignac number, because 134341421211 - 215 = 134341388443 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (134341421111) 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 63 ways as a sum of consecutive naturals, for example, 37492326 + ... + 37495908.
It is an arithmetic number, because the mean of its divisors is an integer number (3273984000).
Almost surely, 2134341421211 is an apocalyptic number.
134341421211 is a deficient number, since it is larger than the sum of its proper divisors (75193554789).
134341421211 is a wasteful number, since it uses less digits than its factorization.
134341421211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4137 (or 4131 counting only the distinct ones).
The product of its digits is 2304, while the sum is 27.
Adding to 134341421211 its reverse (112124143431), we get a palindrome (246465564642).
The spelling of 134341421211 in words is "one hundred thirty-four billion, three hundred forty-one million, four hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •