Base | Representation |
---|---|
bin | 111101011001100… |
… | …1111011101001001 |
3 | 12022120201200210201 |
4 | 1322303033131021 |
5 | 13204411044001 |
6 | 540234212201 |
7 | 102024601342 |
oct | 17263173511 |
9 | 5276650721 |
10 | 2060253001 |
11 | 967a60634 |
12 | 495b84061 |
13 | 26aab2521 |
14 | 1578a10c9 |
15 | c0d15501 |
hex | 7accf749 |
2060253001 has 8 divisors (see below), whose sum is σ = 2181945600. Its totient is φ = 1938616128.
The previous prime is 2060252917. The next prime is 2060253031. The reversal of 2060253001 is 1003520602.
It is a happy number.
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 2060253001 - 227 = 1926035273 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2060253001.
It is not an unprimeable number, because it can be changed into a prime (2060253031) 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, 80560 + ... + 103006.
It is an arithmetic number, because the mean of its divisors is an integer number (272743200).
Almost surely, 22060253001 is an apocalyptic number.
It is an amenable number.
2060253001 is a deficient number, since it is larger than the sum of its proper divisors (121692599).
2060253001 is a wasteful number, since it uses less digits than its factorization.
2060253001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27863.
The product of its (nonzero) digits is 360, while the sum is 19.
The square root of 2060253001 is about 45390.0099250925. The cubic root of 2060253001 is about 1272.4484151478.
Adding to 2060253001 its reverse (1003520602), we get a palindrome (3063773603).
The spelling of 2060253001 in words is "two billion, sixty million, two hundred fifty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •