Base | Representation |
---|---|
bin | 101100100000000000100… |
… | …1010110110001011000001 |
3 | 210122200121020211022221011 |
4 | 1121000001022312023001 |
5 | 1300201134040100144 |
6 | 21001402002400521 |
7 | 1200604332106645 |
oct | 131000112661301 |
9 | 23580536738834 |
10 | 6116053050049 |
11 | 1a48892557668 |
12 | 8293b9960141 |
13 | 35498390b207 |
14 | 172038c70c25 |
15 | a915c696a34 |
hex | 590012b62c1 |
6116053050049 has 2 divisors, whose sum is σ = 6116053050050. Its totient is φ = 6116053050048.
The previous prime is 6116053050043. The next prime is 6116053050067. The reversal of 6116053050049 is 9400503506116.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4802409273600 + 1313643776449 = 2191440^2 + 1146143^2 .
It is a cyclic number.
It is not a de Polignac number, because 6116053050049 - 25 = 6116053050017 is a prime.
It is a super-3 number, since 3×61160530500493 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 6116053049993 and 6116053050020.
It is not a weakly prime, because it can be changed into another prime (6116053050043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3058026525024 + 3058026525025.
It is an arithmetic number, because the mean of its divisors is an integer number (3058026525025).
Almost surely, 26116053050049 is an apocalyptic number.
It is an amenable number.
6116053050049 is a deficient number, since it is larger than the sum of its proper divisors (1).
6116053050049 is an equidigital number, since it uses as much as digits as its factorization.
6116053050049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 97200, while the sum is 40.
The spelling of 6116053050049 in words is "six trillion, one hundred sixteen billion, fifty-three million, fifty thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •