Base | Representation |
---|---|
bin | 111110100110011011… |
… | …1010001100100000011 |
3 | 110211222220102122020212 |
4 | 1331030313101210003 |
5 | 4200304441410301 |
6 | 141431413224335 |
7 | 12466250162633 |
oct | 1751467214403 |
9 | 424886378225 |
10 | 134433544451 |
11 | 5201625a758 |
12 | 220796320ab |
13 | c8a5580c0b |
14 | 67142366c3 |
15 | 376c1c64bb |
hex | 1f4cdd1903 |
134433544451 has 4 divisors (see below), whose sum is σ = 134459903904. Its totient is φ = 134407185000.
The previous prime is 134433544439. The next prime is 134433544529. The reversal of 134433544451 is 154445334431.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 134433544451 - 218 = 134433282307 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 134433544399 and 134433544408.
It is not an unprimeable number, because it can be changed into a prime (134433544411) 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 3 ways as a sum of consecutive naturals, for example, 13172075 + ... + 13182276.
It is an arithmetic number, because the mean of its divisors is an integer number (33614975976).
Almost surely, 2134433544451 is an apocalyptic number.
134433544451 is a deficient number, since it is larger than the sum of its proper divisors (26359453).
134433544451 is an equidigital number, since it uses as much as digits as its factorization.
134433544451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26359452.
The product of its digits is 691200, while the sum is 41.
Adding to 134433544451 its reverse (154445334431), we get a palindrome (288878878882).
The spelling of 134433544451 in words is "one hundred thirty-four billion, four hundred thirty-three million, five hundred forty-four thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •