Base | Representation |
---|---|
bin | 11110100110101110000100… |
… | …010111110110000110100000 |
3 | 122122120211210211000000100122 |
4 | 132212232010113312012200 |
5 | 120120310301414322033 |
6 | 1154135221503535412 |
7 | 40231455006165332 |
oct | 3646560427660640 |
9 | 578524724000318 |
10 | 134602200932768 |
11 | 39985522399798 |
12 | 1311a9848ba568 |
13 | 5a14c18ca81aa |
14 | 2534ad1bc3452 |
15 | 10864a3724a98 |
hex | 7a6b845f61a0 |
134602200932768 has 12 divisors (see below), whose sum is σ = 264998083086450. Its totient is φ = 67301100466368.
The previous prime is 134602200932747. The next prime is 134602200932869. The reversal of 134602200932768 is 867239002206431.
It is a happy number.
134602200932768 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 133286747920144 + 1315453012624 = 11544988^2 + 1146932^2 .
It is a super-2 number, since 2×1346022009327682 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2103159389543 + ... + 2103159389606.
Almost surely, 2134602200932768 is an apocalyptic number.
It is an amenable number.
134602200932768 is a deficient number, since it is larger than the sum of its proper divisors (130395882153682).
134602200932768 is an equidigital number, since it uses as much as digits as its factorization.
134602200932768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4206318779159 (or 4206318779151 counting only the distinct ones).
The product of its (nonzero) digits is 5225472, while the sum is 53.
The spelling of 134602200932768 in words is "one hundred thirty-four trillion, six hundred two billion, two hundred million, nine hundred thirty-two thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •