Base | Representation |
---|---|
bin | 111110100101100001… |
… | …1100001110010110111 |
3 | 110211220210100002112221 |
4 | 1331023003201302313 |
5 | 4200224204432411 |
6 | 141424411023211 |
7 | 12465431240434 |
oct | 1751303416267 |
9 | 424823302487 |
10 | 134403202231 |
11 | 52000116141 |
12 | 2206b43ab07 |
13 | c89c1b923c |
14 | 67101b8b8b |
15 | 37696d1071 |
hex | 1f4b0e1cb7 |
134403202231 has 8 divisors (see below), whose sum is σ = 142935583280. Its totient is φ = 126016674048.
The previous prime is 134403202207. The next prime is 134403202253. The reversal of 134403202231 is 132202304431.
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 134403202231 - 213 = 134403194039 is a prime.
It is a super-2 number, since 2×1344032022312 (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 = 134403202196 and 134403202205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134403202331) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36461316 + ... + 36465001.
It is an arithmetic number, because the mean of its divisors is an integer number (17866947910).
Almost surely, 2134403202231 is an apocalyptic number.
134403202231 is a deficient number, since it is larger than the sum of its proper divisors (8532381049).
134403202231 is an equidigital number, since it uses as much as digits as its factorization.
134403202231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72926433.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 134403202231 its reverse (132202304431), we get a palindrome (266605506662).
The spelling of 134403202231 in words is "one hundred thirty-four billion, four hundred three million, two hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •