Base | Representation |
---|---|
bin | 101011110101001100001… |
… | …0110000001110001010001 |
3 | 210022220020220001110102222 |
4 | 1113222120112001301101 |
5 | 1242144324103411431 |
6 | 20451233334550425 |
7 | 1161140546434364 |
oct | 127523026016121 |
9 | 23286226043388 |
10 | 6024100060241 |
11 | 1a1289648840a |
12 | 813616b08415 |
13 | 3490bb2c1183 |
14 | 16b7d48340db |
15 | a6a79b4157b |
hex | 57a98581c51 |
6024100060241 has 16 divisors (see below), whose sum is σ = 6449507043264. Its totient is φ = 5606775573504.
The previous prime is 6024100060193. The next prime is 6024100060243. The reversal of 6024100060241 is 1420600014206.
It is a cyclic number.
It is not a de Polignac number, because 6024100060241 - 234 = 6006920191057 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 6024100060241.
It is not an unprimeable number, because it can be changed into a prime (6024100060243) 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 15 ways as a sum of consecutive naturals, for example, 1917080 + ... + 3965273.
It is an arithmetic number, because the mean of its divisors is an integer number (403094190204).
Almost surely, 26024100060241 is an apocalyptic number.
It is an amenable number.
6024100060241 is a deficient number, since it is larger than the sum of its proper divisors (425406983023).
6024100060241 is a wasteful number, since it uses less digits than its factorization.
6024100060241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5883040.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 6024100060241 its reverse (1420600014206), we get a palindrome (7444700074447).
The spelling of 6024100060241 in words is "six trillion, twenty-four billion, one hundred million, sixty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •