Base | Representation |
---|---|
bin | 11110100011110100111101… |
… | …011101001011010111101010 |
3 | 122121212211210000020020022111 |
4 | 132203310331131023113222 |
5 | 120104031222304341100 |
6 | 1153504031132112534 |
7 | 40211220413530033 |
oct | 3643647535132752 |
9 | 577784700206274 |
10 | 134403442652650 |
11 | 399091a853a076 |
12 | 130a835500574a |
13 | 59cc261cc9b12 |
14 | 25292389b1a8a |
15 | 108121e2cc6ba |
hex | 7a3d3d74b5ea |
134403442652650 has 48 divisors (see below), whose sum is σ = 250082165904480. Its totient is φ = 53741646792000.
The previous prime is 134403442652627. The next prime is 134403442652659. The reversal of 134403442652650 is 56256244304431.
It is a junction number, because it is equal to n+sod(n) for n = 134403442652594 and 134403442652603.
It is not an unprimeable number, because it can be changed into a prime (134403442652659) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1717379221 + ... + 1717457479.
It is an arithmetic number, because the mean of its divisors is an integer number (5210045123010).
Almost surely, 2134403442652650 is an apocalyptic number.
134403442652650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
134403442652650 is a deficient number, since it is larger than the sum of its proper divisors (115678723251830).
134403442652650 is a wasteful number, since it uses less digits than its factorization.
134403442652650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90439 (or 90434 counting only the distinct ones).
The product of its (nonzero) digits is 8294400, while the sum is 49.
The spelling of 134403442652650 in words is "one hundred thirty-four trillion, four hundred three billion, four hundred forty-two million, six hundred fifty-two thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •