Base | Representation |
---|---|
bin | 111110110100100110… |
… | …1101000110001000110 |
3 | 110220020001101212002011 |
4 | 1331221031220301012 |
5 | 4202243221344320 |
6 | 141550523404434 |
7 | 12514114004401 |
oct | 1755115506106 |
9 | 426201355064 |
10 | 134909168710 |
11 | 5223a788258 |
12 | 2219098371a |
13 | c94cc7cca4 |
14 | 675b484d38 |
15 | 3798d2705a |
hex | 1f69368c46 |
134909168710 has 8 divisors (see below), whose sum is σ = 242836503696. Its totient is φ = 53963667480.
The previous prime is 134909168707. The next prime is 134909168743. The reversal of 134909168710 is 17861909431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6745458426 + ... + 6745458445.
It is an arithmetic number, because the mean of its divisors is an integer number (30354562962).
Almost surely, 2134909168710 is an apocalyptic number.
134909168710 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
134909168710 is a deficient number, since it is larger than the sum of its proper divisors (107927334986).
134909168710 is a wasteful number, since it uses less digits than its factorization.
134909168710 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13490916878.
The product of its (nonzero) digits is 326592, while the sum is 49.
The spelling of 134909168710 in words is "one hundred thirty-four billion, nine hundred nine million, one hundred sixty-eight thousand, seven hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •