Base | Representation |
---|---|
bin | 10000000010001… |
… | …11101000110110 |
3 | 100101002212121202 |
4 | 20001013220312 |
5 | 233413324113 |
6 | 21203012502 |
7 | 3222216545 |
oct | 1001075066 |
9 | 311085552 |
10 | 134511158 |
11 | 69a23251 |
12 | 3906a132 |
13 | 21b37c02 |
14 | 13c1615c |
15 | bc20258 |
hex | 8047a36 |
134511158 has 4 divisors (see below), whose sum is σ = 201766740. Its totient is φ = 67255578.
The previous prime is 134511149. The next prime is 134511229. The reversal of 134511158 is 851115431.
134511158 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 851115431 = 19 ⋅44795549.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 134511158.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 33627788 + ... + 33627791.
It is an arithmetic number, because the mean of its divisors is an integer number (50441685).
Almost surely, 2134511158 is an apocalyptic number.
134511158 is a deficient number, since it is larger than the sum of its proper divisors (67255582).
134511158 is an equidigital number, since it uses as much as digits as its factorization.
134511158 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67255581.
The product of its digits is 2400, while the sum is 29.
The square root of 134511158 is about 11597.8945503052. The cubic root of 134511158 is about 512.3728439646.
Adding to 134511158 its reverse (851115431), we get a palindrome (985626589).
The spelling of 134511158 in words is "one hundred thirty-four million, five hundred eleven thousand, one hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •