Base | Representation |
---|---|
bin | 10000000101101… |
… | …00010011000111 |
3 | 100101221111010221 |
4 | 20002310103013 |
5 | 234022044411 |
6 | 21220325211 |
7 | 3226052254 |
oct | 1002642307 |
9 | 311844127 |
10 | 134956231 |
11 | 6a1a7683 |
12 | 39243807 |
13 | 21c62677 |
14 | 13cd042b |
15 | bcac071 |
hex | 80b44c7 |
134956231 has 8 divisors (see below), whose sum is σ = 138268944. Its totient is φ = 131651520.
The previous prime is 134956219. The next prime is 134956247. The reversal of 134956231 is 132659431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 134956231 - 29 = 134955719 is a prime.
It is a super-2 number, since 2×1349562312 = 36426368571450722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134956201) by changing a digit.
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 in 7 ways as a sum of consecutive naturals, for example, 45741 + ... + 48601.
It is an arithmetic number, because the mean of its divisors is an integer number (17283618).
Almost surely, 2134956231 is an apocalyptic number.
134956231 is a deficient number, since it is larger than the sum of its proper divisors (3312713).
134956231 is a wasteful number, since it uses less digits than its factorization.
134956231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4001.
The product of its digits is 19440, while the sum is 34.
The square root of 134956231 is about 11617.0663680638. The cubic root of 134956231 is about 512.9373380570.
The spelling of 134956231 in words is "one hundred thirty-four million, nine hundred fifty-six thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •