Base | Representation |
---|---|
bin | 111110101101001001… |
… | …0111101111000100001 |
3 | 110212120121111021111011 |
4 | 1331122102331320201 |
5 | 4201240140021211 |
6 | 141510023420521 |
7 | 12504654554404 |
oct | 1753222757041 |
9 | 425517437434 |
10 | 134658907681 |
11 | 52121496461 |
12 | 22120bb4741 |
13 | c91017883c |
14 | 673613bd3b |
15 | 3781d90921 |
hex | 1f5a4bde21 |
134658907681 has 9 divisors (see below), whose sum is σ = 136723702899. Its totient is φ = 132624853944.
The previous prime is 134658907673. The next prime is 134658907687. The reversal of 134658907681 is 186709856431.
The square root of 134658907681 is 366959.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 134560580625 + 98327056 = 366825^2 + 9916^2 .
It is not a de Polignac number, because 134658907681 - 23 = 134658907673 is a prime.
It is a super-2 number, since 2×1346589076812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134658907687) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 24583515 + ... + 24588991.
Almost surely, 2134658907681 is an apocalyptic number.
134658907681 is the 366959-th square number.
134658907681 is the 183480-th centered octagonal number.
It is an amenable number.
134658907681 is a deficient number, since it is larger than the sum of its proper divisors (2064795218).
134658907681 is an frugal number, since it uses more digits than its factorization.
134658907681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11088 (or 5544 counting only the distinct ones).
The product of its (nonzero) digits is 8709120, while the sum is 58.
The spelling of 134658907681 in words is "one hundred thirty-four billion, six hundred fifty-eight million, nine hundred seven thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •