Base | Representation |
---|---|
bin | 10000000000110… |
… | …11101011011101 |
3 | 100100202201121222 |
4 | 20000123223131 |
5 | 233342043401 |
6 | 21155103125 |
7 | 3220536602 |
oct | 1000335335 |
9 | 310681558 |
10 | 134331101 |
11 | 6990aa43 |
12 | 38ba1aa5 |
13 | 21aa3c78 |
14 | 13baa6a9 |
15 | bbd6c1b |
hex | 801badd |
134331101 has 8 divisors (see below), whose sum is σ = 136345440. Its totient is φ = 132326352.
The previous prime is 134331079. The next prime is 134331107. The reversal of 134331101 is 101133431.
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-134331101 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 134331101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134331107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28790 + ... + 33128.
It is an arithmetic number, because the mean of its divisors is an integer number (17043180).
Almost surely, 2134331101 is an apocalyptic number.
It is an amenable number.
134331101 is a deficient number, since it is larger than the sum of its proper divisors (2014339).
134331101 is an equidigital number, since it uses as much as digits as its factorization.
134331101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4795.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 134331101 is about 11590.1294643330. The cubic root of 134331101 is about 512.1441206527.
Adding to 134331101 its reverse (101133431), we get a palindrome (235464532).
The spelling of 134331101 in words is "one hundred thirty-four million, three hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •