Base | Representation |
---|---|
bin | 111000000100111111… |
… | …010111010000011101 |
3 | 12202102100212121022102 |
4 | 320010333113100131 |
5 | 1441304043330331 |
6 | 43354523054445 |
7 | 4231066163612 |
oct | 700477272035 |
9 | 182370777272 |
10 | 60213261341 |
11 | 235998a8502 |
12 | b805371425 |
13 | 58a79a862c |
14 | 2cb2d28509 |
15 | 187632b4cb |
hex | e04fd741d |
60213261341 has 8 divisors (see below), whose sum is σ = 60275215800. Its totient is φ = 60151336960.
The previous prime is 60213261301. The next prime is 60213261349. The reversal of 60213261341 is 14316231206.
It can be written as a sum of positive squares in 4 ways, for example, as 9278116 + 60203983225 = 3046^2 + 245365^2 .
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 60213261341 - 214 = 60213244957 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 (60213261349) 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, 6884231 + ... + 6892971.
It is an arithmetic number, because the mean of its divisors is an integer number (7534401975).
Almost surely, 260213261341 is an apocalyptic number.
It is an amenable number.
60213261341 is a deficient number, since it is larger than the sum of its proper divisors (61954459).
60213261341 is a wasteful number, since it uses less digits than its factorization.
60213261341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15039.
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 60213261341 its reverse (14316231206), we get a palindrome (74529492547).
The spelling of 60213261341 in words is "sixty billion, two hundred thirteen million, two hundred sixty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •