Base | Representation |
---|---|
bin | 10000000000110… |
… | …11111010001001 |
3 | 100100202202220210 |
4 | 20000123322021 |
5 | 233342111131 |
6 | 21155111333 |
7 | 3220542414 |
oct | 1000337211 |
9 | 310682823 |
10 | 134332041 |
11 | 69910718 |
12 | 38ba2549 |
13 | 21aa451c |
14 | 13baab7b |
15 | bbd7146 |
hex | 801be89 |
134332041 has 4 divisors (see below), whose sum is σ = 179109392. Its totient is φ = 89554692.
The previous prime is 134332039. The next prime is 134332057. The reversal of 134332041 is 140233431.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 134332041 - 21 = 134332039 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 134331999 and 134332017.
It is not an unprimeable number, because it can be changed into a prime (134332001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22388671 + ... + 22388676.
It is an arithmetic number, because the mean of its divisors is an integer number (44777348).
Almost surely, 2134332041 is an apocalyptic number.
It is an amenable number.
134332041 is a deficient number, since it is larger than the sum of its proper divisors (44777351).
134332041 is an equidigital number, since it uses as much as digits as its factorization.
134332041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44777350.
The product of its (nonzero) digits is 864, while the sum is 21.
The square root of 134332041 is about 11590.1700160093. The cubic root of 134332041 is about 512.1453152491.
Adding to 134332041 its reverse (140233431), we get a palindrome (274565472).
The spelling of 134332041 in words is "one hundred thirty-four million, three hundred thirty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •