Base | Representation |
---|---|
bin | 111110100110100111… |
… | …1111101011001010001 |
3 | 110212000100121101210011 |
4 | 1331031033331121101 |
5 | 4200313120443231 |
6 | 141432204034521 |
7 | 12466356163534 |
oct | 1751517753121 |
9 | 425010541704 |
10 | 134440015441 |
11 | 5201997a486 |
12 | 2207b832a41 |
13 | c8a6a083c4 |
14 | 671503ca1b |
15 | 376ca539b1 |
hex | 1f4d3fd651 |
134440015441 has 8 divisors (see below), whose sum is σ = 137962988064. Its totient is φ = 130935063840.
The previous prime is 134440015351. The next prime is 134440015459. The reversal of 134440015441 is 144510044431.
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 134440015441 - 225 = 134406461009 is a prime.
It is a super-3 number, since 3×1344400154413 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134440015741) 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, 4490140 + ... + 4519981.
It is an arithmetic number, because the mean of its divisors is an integer number (17245373508).
Almost surely, 2134440015441 is an apocalyptic number.
It is an amenable number.
134440015441 is a deficient number, since it is larger than the sum of its proper divisors (3522972623).
134440015441 is an equidigital number, since it uses as much as digits as its factorization.
134440015441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9010511.
The product of its (nonzero) digits is 15360, while the sum is 31.
Adding to 134440015441 its reverse (144510044431), we get a palindrome (278950059872).
The spelling of 134440015441 in words is "one hundred thirty-four billion, four hundred forty million, fifteen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •