Base | Representation |
---|---|
bin | 111110110010101111… |
… | …0011111000101101001 |
3 | 110220001200102202201222 |
4 | 1331211132133011221 |
5 | 4202131144223044 |
6 | 141540403551425 |
7 | 12512423065613 |
oct | 1754536370551 |
9 | 426050382658 |
10 | 134846476649 |
11 | 52208358835 |
12 | 2217398b575 |
13 | c93cc9c8b1 |
14 | 6753005db3 |
15 | 37935918ee |
hex | 1f6579f169 |
134846476649 has 4 divisors (see below), whose sum is σ = 135092997264. Its totient is φ = 134599956036.
The previous prime is 134846476621. The next prime is 134846476673. The reversal of 134846476649 is 946674648431.
It is a happy number.
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 a cyclic number.
It is not a de Polignac number, because 134846476649 - 216 = 134846411113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 134846476591 and 134846476600.
It is not an unprimeable number, because it can be changed into a prime (134846473649) 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 3 ways as a sum of consecutive naturals, for example, 123259487 + ... + 123260580.
It is an arithmetic number, because the mean of its divisors is an integer number (33773249316).
Almost surely, 2134846476649 is an apocalyptic number.
It is an amenable number.
134846476649 is a deficient number, since it is larger than the sum of its proper divisors (246520615).
134846476649 is an equidigital number, since it uses as much as digits as its factorization.
134846476649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 246520614.
The product of its digits is 83607552, while the sum is 62.
The spelling of 134846476649 in words is "one hundred thirty-four billion, eight hundred forty-six million, four hundred seventy-six thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •