Base | Representation |
---|---|
bin | 1011010001011101… |
… | …00011100100110110 |
3 | 120121202220120011000 |
4 | 11220232203210312 |
5 | 44343303031402 |
6 | 2440311224130 |
7 | 302655111666 |
oct | 55056434466 |
9 | 16552816130 |
10 | 6052002102 |
11 | 2626219833 |
12 | 120a978046 |
13 | 755aa5543 |
14 | 415aa81a6 |
15 | 2564aac1c |
hex | 168ba3936 |
6052002102 has 32 divisors (see below), whose sum is σ = 13456396800. Its totient is φ = 2016208584.
The previous prime is 6052002097. The next prime is 6052002109. The reversal of 6052002102 is 2012002506.
It is a super-2 number, since 2×60520021022 = 73253458885224836808, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6052002109) 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 15 ways as a sum of consecutive naturals, for example, 69399 + ... + 130077.
It is an arithmetic number, because the mean of its divisors is an integer number (420512400).
Almost surely, 26052002102 is an apocalyptic number.
6052002102 is an abundant number, since it is smaller than the sum of its proper divisors (7404394698).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6052002102 is a wasteful number, since it uses less digits than its factorization.
6052002102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62537 (or 62531 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The square root of 6052002102 is about 77794.6148650406. The cubic root of 6052002102 is about 1822.3551707973.
Adding to 6052002102 its reverse (2012002506), we get a palindrome (8064004608).
The spelling of 6052002102 in words is "six billion, fifty-two million, two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •