Base | Representation |
---|---|
bin | 111110100001010001… |
… | …1110111100100000000 |
3 | 110211112212011110202001 |
4 | 1331002203313210000 |
5 | 4144431213410211 |
6 | 141402320233344 |
7 | 12462050664451 |
oct | 1750243674400 |
9 | 424485143661 |
10 | 134260685056 |
11 | 51a37724953 |
12 | 2202b76b854 |
13 | c87880a254 |
14 | 66d92bb128 |
15 | 375be2dac1 |
hex | 1f428f7900 |
134260685056 has 27 divisors (see below), whose sum is σ = 268008617233. Its totient is φ = 67127411200.
The previous prime is 134260685033. The next prime is 134260685063. The reversal of 134260685056 is 650586062431.
The square root of 134260685056 is 366416.
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., 131925862656 + 2334822400 = 363216^2 + 48320^2 .
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 134260684997 and 134260685015.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 5851206 + ... + 5874106.
Almost surely, 2134260685056 is an apocalyptic number.
134260685056 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
134260685056 is the 366416-th square number.
It is an amenable number.
134260685056 is a deficient number, since it is larger than the sum of its proper divisors (133747932177).
134260685056 is an frugal number, since it uses more digits than its factorization.
134260685056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45818 (or 22903 counting only the distinct ones).
The product of its (nonzero) digits is 1036800, while the sum is 46.
The spelling of 134260685056 in words is "one hundred thirty-four billion, two hundred sixty million, six hundred eighty-five thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •