Base | Representation |
---|---|
bin | 111000000000000110… |
… | …110101001110111101 |
3 | 12202012122201012211101 |
4 | 320000012311032331 |
5 | 1441122110124203 |
6 | 43342435053101 |
7 | 4226052616621 |
oct | 700006651675 |
9 | 182178635741 |
10 | 60131333053 |
11 | 2355762a580 |
12 | b7a1a41191 |
13 | 5893a2165c |
14 | 2ca60bd181 |
15 | 186e04641d |
hex | e001b53bd |
60131333053 has 8 divisors (see below), whose sum is σ = 65634547680. Its totient is φ = 54634240080.
The previous prime is 60131333027. The next prime is 60131333069. The reversal of 60131333053 is 35033313106.
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 60131333053 - 213 = 60131324861 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (60131331053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1509858 + ... + 1549171.
It is an arithmetic number, because the mean of its divisors is an integer number (8204318460).
Almost surely, 260131333053 is an apocalyptic number.
It is an amenable number.
60131333053 is a deficient number, since it is larger than the sum of its proper divisors (5503214627).
60131333053 is a wasteful number, since it uses less digits than its factorization.
60131333053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3060827.
The product of its (nonzero) digits is 7290, while the sum is 28.
Adding to 60131333053 its reverse (35033313106), we get a palindrome (95164646159).
It can be divided in two parts, 6013 and 1333053, that added together give a triangular number (1339066 = T1636).
The spelling of 60131333053 in words is "sixty billion, one hundred thirty-one million, three hundred thirty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •