Base | Representation |
---|---|
bin | 111110101100110001… |
… | …1010000100001010111 |
3 | 110212112201221212200212 |
4 | 1331121203100201113 |
5 | 4201223434313421 |
6 | 141504455400035 |
7 | 12504443345165 |
oct | 1753143204127 |
9 | 425481855625 |
10 | 134646401111 |
11 | 52115424052 |
12 | 2211898301b |
13 | c90a6ba0c1 |
14 | 6734604235 |
15 | 3780c1ee5b |
hex | 1f598d0857 |
134646401111 has 4 divisors (see below), whose sum is σ = 136853719224. Its totient is φ = 132439083000.
The previous prime is 134646401107. The next prime is 134646401159. The reversal of 134646401111 is 111104646431.
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 134646401111 - 22 = 134646401107 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134646401311) 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, 1103658965 + ... + 1103659086.
It is an arithmetic number, because the mean of its divisors is an integer number (34213429806).
Almost surely, 2134646401111 is an apocalyptic number.
134646401111 is a deficient number, since it is larger than the sum of its proper divisors (2207318113).
134646401111 is an equidigital number, since it uses as much as digits as its factorization.
134646401111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2207318112.
The product of its (nonzero) digits is 6912, while the sum is 32.
The spelling of 134646401111 in words is "one hundred thirty-four billion, six hundred forty-six million, four hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •