Base | Representation |
---|---|
bin | 100110001011011001000… |
… | …0011000001111001010101 |
3 | 200120121210100210001121112 |
4 | 1030112302003001321111 |
5 | 1141432121401111221 |
6 | 15054300455424405 |
7 | 1051044034601066 |
oct | 114266203017125 |
9 | 20517710701545 |
10 | 5247142207061 |
11 | 1743333a8a667 |
12 | 708b21385105 |
13 | 2c0a5a06c701 |
14 | 141d6a80c56d |
15 | 917546d715b |
hex | 4c5b20c1e55 |
5247142207061 has 32 divisors (see below), whose sum is σ = 5768290281600. Its totient is φ = 4755628800000.
The previous prime is 5247142207033. The next prime is 5247142207081. The reversal of 5247142207061 is 1607022417425.
It is a cyclic number.
It is not a de Polignac number, because 5247142207061 - 234 = 5229962337877 is a prime.
It is a super-2 number, since 2×52471422070612 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5247142207001) 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 31 ways as a sum of consecutive naturals, for example, 18288011 + ... + 18572711.
It is an arithmetic number, because the mean of its divisors is an integer number (180259071300).
Almost surely, 25247142207061 is an apocalyptic number.
It is an amenable number.
5247142207061 is a deficient number, since it is larger than the sum of its proper divisors (521148074539).
5247142207061 is a wasteful number, since it uses less digits than its factorization.
5247142207061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285221.
The product of its (nonzero) digits is 188160, while the sum is 41.
The spelling of 5247142207061 in words is "five trillion, two hundred forty-seven billion, one hundred forty-two million, two hundred seven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •