Base | Representation |
---|---|
bin | 101101000111100110110… |
… | …0100100100101110110111 |
3 | 210221211002101200120220110 |
4 | 1122033031210210232313 |
5 | 1303044311200200142 |
6 | 21104423453234103 |
7 | 1210004465321604 |
oct | 132171544445667 |
9 | 23854071616813 |
10 | 6201086725047 |
11 | 1a80958881225 |
12 | 84198b492933 |
13 | 35c9b5862536 |
14 | 1761c43556ab |
15 | ab487a1e99c |
hex | 5a3cd924bb7 |
6201086725047 has 32 divisors (see below), whose sum is σ = 8414900705536. Its totient is φ = 4060850112000.
The previous prime is 6201086725039. The next prime is 6201086725081. The reversal of 6201086725047 is 7405276801026.
6201086725047 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 6201086725047 - 23 = 6201086725039 is a prime.
It is a super-3 number, since 3×62010867250473 (a number of 39 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6201086724987 and 6201086725005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6201086725027) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 582201672 + ... + 582212322.
It is an arithmetic number, because the mean of its divisors is an integer number (262965647048).
Almost surely, 26201086725047 is an apocalyptic number.
6201086725047 is a deficient number, since it is larger than the sum of its proper divisors (2213813980489).
6201086725047 is a wasteful number, since it uses less digits than its factorization.
6201086725047 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14671.
The product of its (nonzero) digits is 1128960, while the sum is 48.
The spelling of 6201086725047 in words is "six trillion, two hundred one billion, eighty-six million, seven hundred twenty-five thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •