Base | Representation |
---|---|
bin | 111110101010010011… |
… | …0101011001011010001 |
3 | 110212022221210112011202 |
4 | 1331110212223023101 |
5 | 4201041213120031 |
6 | 141452332520545 |
7 | 12502415055362 |
oct | 1752446531321 |
9 | 425287715152 |
10 | 134563410641 |
11 | 520825a0090 |
12 | 220b5020155 |
13 | c8c645080a |
14 | 672759db69 |
15 | 37787ca2cb |
hex | 1f549ab2d1 |
134563410641 has 8 divisors (see below), whose sum is σ = 147405564768. Its totient is φ = 121822776000.
The previous prime is 134563410617. The next prime is 134563410643. The reversal of 134563410641 is 146014365431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 134563410641 - 26 = 134563410577 is a prime.
It is a super-2 number, since 2×1345634106412 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 134563410595 and 134563410604.
It is not an unprimeable number, because it can be changed into a prime (134563410643) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25377095 + ... + 25382396.
It is an arithmetic number, because the mean of its divisors is an integer number (18425695596).
Almost surely, 2134563410641 is an apocalyptic number.
134563410641 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
134563410641 is a deficient number, since it is larger than the sum of its proper divisors (12842154127).
134563410641 is a wasteful number, since it uses less digits than its factorization.
134563410641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50759743.
The product of its (nonzero) digits is 103680, while the sum is 38.
The spelling of 134563410641 in words is "one hundred thirty-four billion, five hundred sixty-three million, four hundred ten thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •