Base | Representation |
---|---|
bin | 111110101001101100… |
… | …0111011011111010111 |
3 | 110212021112110002111202 |
4 | 1331103120323133113 |
5 | 4201021003431411 |
6 | 141450324023115 |
7 | 12502046613311 |
oct | 1752330733727 |
9 | 425245402452 |
10 | 134543030231 |
11 | 5207203aa75 |
12 | 220aa231a9b |
13 | c8c21661bc |
14 | 67249b67b1 |
15 | 3776b0183b |
hex | 1f5363b7d7 |
134543030231 has 4 divisors (see below), whose sum is σ = 134699658600. Its totient is φ = 134386401864.
The previous prime is 134543030227. The next prime is 134543030263. The reversal of 134543030231 is 132030345431.
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 134543030231 - 22 = 134543030227 is a prime.
It is a super-2 number, since 2×1345430302312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 134543030194 and 134543030203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134543030201) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 78312896 + ... + 78314613.
It is an arithmetic number, because the mean of its divisors is an integer number (33674914650).
Almost surely, 2134543030231 is an apocalyptic number.
134543030231 is a deficient number, since it is larger than the sum of its proper divisors (156628369).
134543030231 is an equidigital number, since it uses as much as digits as its factorization.
134543030231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156628368.
The product of its (nonzero) digits is 12960, while the sum is 29.
Adding to 134543030231 its reverse (132030345431), we get a palindrome (266573375662).
The spelling of 134543030231 in words is "one hundred thirty-four billion, five hundred forty-three million, thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •