Base | Representation |
---|---|
bin | 111110101000100100… |
… | …1001101011100010111 |
3 | 110212011220112222211222 |
4 | 1331101021031130113 |
5 | 4200431332330111 |
6 | 141442500320555 |
7 | 12501111440135 |
oct | 1752111153427 |
9 | 425156488758 |
10 | 134505355031 |
11 | 52052848043 |
12 | 220996a315b |
13 | c8b7404898 |
14 | 671d9aa755 |
15 | 377365d7db |
hex | 1f5124d717 |
134505355031 has 4 divisors (see below), whose sum is σ = 134546478864. Its totient is φ = 134464231200.
The previous prime is 134505355027. The next prime is 134505355109. The reversal of 134505355031 is 130553505431.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 130553505431 = 31 ⋅4211403401.
It is a cyclic number.
It is not a de Polignac number, because 134505355031 - 22 = 134505355027 is a prime.
It is a super-2 number, since 2×1345053550312 (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 = 134505354982 and 134505355000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134505385031) 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, 20557010 + ... + 20563551.
It is an arithmetic number, because the mean of its divisors is an integer number (33636619716).
Almost surely, 2134505355031 is an apocalyptic number.
134505355031 is a deficient number, since it is larger than the sum of its proper divisors (41123833).
134505355031 is an equidigital number, since it uses as much as digits as its factorization.
134505355031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41123832.
The product of its (nonzero) digits is 67500, while the sum is 35.
The spelling of 134505355031 in words is "one hundred thirty-four billion, five hundred five million, three hundred fifty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •