Base | Representation |
---|---|
bin | 111110100111010100… |
… | …1111011100110010011 |
3 | 110212001222222200010222 |
4 | 1331032221323212103 |
5 | 4200340140213133 |
6 | 141434405343255 |
7 | 12500063515322 |
oct | 1751651734623 |
9 | 425058880128 |
10 | 134463601043 |
11 | 52031219712 |
12 | 22087707b2b |
13 | c8ab875895 |
14 | 671821c0b9 |
15 | 376eb61e98 |
hex | 1f4ea7b993 |
134463601043 has 8 divisors (see below), whose sum is σ = 135476901840. Its totient is φ = 133450761600.
The previous prime is 134463601037. The next prime is 134463601067. The reversal of 134463601043 is 340106364431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134463601043 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 134463600994 and 134463601012.
It is not an unprimeable number, because it can be changed into a prime (134463601343) 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, 481343 + ... + 707543.
It is an arithmetic number, because the mean of its divisors is an integer number (16934612730).
Almost surely, 2134463601043 is an apocalyptic number.
134463601043 is a deficient number, since it is larger than the sum of its proper divisors (1013300797).
134463601043 is a wasteful number, since it uses less digits than its factorization.
134463601043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 230677.
The product of its (nonzero) digits is 62208, while the sum is 35.
Adding to 134463601043 its reverse (340106364431), we get a palindrome (474569965474).
The spelling of 134463601043 in words is "one hundred thirty-four billion, four hundred sixty-three million, six hundred one thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •