Base | Representation |
---|---|
bin | 100001000010100111011… |
… | …1001001110100110000101 |
3 | 121002010101100102211202101 |
4 | 1002011032321032212011 |
5 | 1043400140114303314 |
6 | 13354053203512101 |
7 | 646040535413503 |
oct | 102051671164605 |
9 | 17063340384671 |
10 | 4541104056709 |
11 | 14a0964943270 |
12 | 61411a688631 |
13 | 26c2bb96a04c |
14 | 119b0d607673 |
15 | 7d1d04ad174 |
hex | 4214ee4e985 |
4541104056709 has 8 divisors (see below), whose sum is σ = 4981301488800. Its totient is φ = 4105468256400.
The previous prime is 4541104056691. The next prime is 4541104056737. The reversal of 4541104056709 is 9076504011454.
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 4541104056709 - 27 = 4541104056581 is a prime.
It is a super-5 number, since 5×45411040567095 (a number of 64 digits) contains 55555 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4541104056779) 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, 1140405859 + ... + 1140409840.
It is an arithmetic number, because the mean of its divisors is an integer number (622662686100).
Almost surely, 24541104056709 is an apocalyptic number.
It is an amenable number.
4541104056709 is a deficient number, since it is larger than the sum of its proper divisors (440197432091).
4541104056709 is a wasteful number, since it uses less digits than its factorization.
4541104056709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2280815891.
The product of its (nonzero) digits is 604800, while the sum is 46.
The spelling of 4541104056709 in words is "four trillion, five hundred forty-one billion, one hundred four million, fifty-six thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •