Base | Representation |
---|---|
bin | 111110101000101110… |
… | …0111000011101011001 |
3 | 110212012021020222211101 |
4 | 1331101130320131121 |
5 | 4200434142340321 |
6 | 141443203031401 |
7 | 12501203326000 |
oct | 1752134703531 |
9 | 425167228741 |
10 | 134510511961 |
11 | 5205574a571 |
12 | 2209b36b561 |
13 | c8b84bbc17 |
14 | 672054dc37 |
15 | 3773d2b791 |
hex | 1f51738759 |
134510511961 has 32 divisors (see below), whose sum is σ = 157613932800. Its totient is φ = 114744672000.
The previous prime is 134510511959. The next prime is 134510512067. The reversal of 134510511961 is 169115015431.
It is not a de Polignac number, because 134510511961 - 21 = 134510511959 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 134510511961.
It is not an unprimeable number, because it can be changed into a prime (134510517961) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 111998161 + ... + 111999361.
It is an arithmetic number, because the mean of its divisors is an integer number (4925435400).
Almost surely, 2134510511961 is an apocalyptic number.
It is an amenable number.
134510511961 is a deficient number, since it is larger than the sum of its proper divisors (23103420839).
134510511961 is an equidigital number, since it uses as much as digits as its factorization.
134510511961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2510 (or 2496 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 37.
The spelling of 134510511961 in words is "one hundred thirty-four billion, five hundred ten million, five hundred eleven thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •