Base | Representation |
---|---|
bin | 10001001010001010100000… |
… | …101110111101000100100001 |
3 | 100220012102001120012011111220 |
4 | 101022022200232331010201 |
5 | 34342410334121212144 |
6 | 424300133430525253 |
7 | 21616120535425653 |
oct | 2112124056750441 |
9 | 326172046164456 |
10 | 75465272054049 |
11 | 220557077762a9 |
12 | 8569812b06829 |
13 | 3315463189a97 |
14 | 148c7781026d3 |
15 | 8ad059108919 |
hex | 44a2a0bbd121 |
75465272054049 has 8 divisors (see below), whose sum is σ = 100666924692192. Its totient is φ = 50286900392640.
The previous prime is 75465272054021. The next prime is 75465272054069. The reversal of 75465272054049 is 94045027256457.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 75465272054049 - 212 = 75465272049953 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 75465272053983 and 75465272054001.
It is not an unprimeable number, because it can be changed into a prime (75465272054069) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 5820236619 + ... + 5820249584.
It is an arithmetic number, because the mean of its divisors is an integer number (12583365586524).
Almost surely, 275465272054049 is an apocalyptic number.
It is an amenable number.
75465272054049 is a deficient number, since it is larger than the sum of its proper divisors (25201652638143).
75465272054049 is a wasteful number, since it uses less digits than its factorization.
75465272054049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11640488367.
The product of its (nonzero) digits is 84672000, while the sum is 60.
The spelling of 75465272054049 in words is "seventy-five trillion, four hundred sixty-five billion, two hundred seventy-two million, fifty-four thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •