Base | Representation |
---|---|
bin | 110000110110101100111… |
… | …0101110010000000110000 |
3 | 212202220101220210010102110 |
4 | 1201231121311302000300 |
5 | 1340002340013414402 |
6 | 22140341223445320 |
7 | 1262052406053543 |
oct | 141553165620060 |
9 | 25686356703373 |
10 | 6714541154352 |
11 | 2159691485589 |
12 | 9053a62b6840 |
13 | 39924226ca85 |
14 | 192db23d685a |
15 | b99d991a56c |
hex | 61b59d72030 |
6714541154352 has 20 divisors (see below), whose sum is σ = 17345897982200. Its totient is φ = 2238180384768.
The previous prime is 6714541154291. The next prime is 6714541154371. The reversal of 6714541154352 is 2534511454176.
It is a Harshad number since it is a multiple of its sum of digits (48), and also a Moran number because the ratio is a prime number: 139886274049 = 6714541154352 / (6 + 7 + 1 + 4 + 5 + 4 + 1 + 1 + 5 + 4 + 3 + 5 + 2).
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, 69943136977 + ... + 69943137072.
It is an arithmetic number, because the mean of its divisors is an integer number (867294899110).
Almost surely, 26714541154352 is an apocalyptic number.
It is an amenable number.
6714541154352 is an abundant number, since it is smaller than the sum of its proper divisors (10631356827848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6714541154352 is a wasteful number, since it uses less digits than its factorization.
6714541154352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139886274060 (or 139886274054 counting only the distinct ones).
The product of its digits is 2016000, while the sum is 48.
The spelling of 6714541154352 in words is "six trillion, seven hundred fourteen billion, five hundred forty-one million, one hundred fifty-four thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •