Base | Representation |
---|---|
bin | 1001110010000110… |
… | …10100111111111100 |
3 | 111120000211102001200 |
4 | 10321003110333330 |
5 | 41224022003202 |
6 | 2225055335500 |
7 | 244103314404 |
oct | 47103247774 |
9 | 14500742050 |
10 | 5252141052 |
11 | 2255773344 |
12 | 1026b21590 |
13 | 659170992 |
14 | 37b777804 |
15 | 20b15ee1c |
hex | 1390d4ffc |
5252141052 has 36 divisors (see below), whose sum is σ = 13373164896. Its totient is φ = 1737933120.
The previous prime is 5252141047. The next prime is 5252141071. The reversal of 5252141052 is 2501412525.
5252141052 is a `hidden beast` number, since 52 + 521 + 41 + 0 + 52 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is an alternating number because its digits alternate between odd and even.
It is a zygodrome in base 11.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 527524 + ... + 537387.
Almost surely, 25252141052 is an apocalyptic number.
It is an amenable number.
5252141052 is an abundant number, since it is smaller than the sum of its proper divisors (8121023844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5252141052 is a wasteful number, since it uses less digits than its factorization.
5252141052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1065058 (or 1065053 counting only the distinct ones).
The product of its (nonzero) digits is 4000, while the sum is 27.
The square root of 5252141052 is about 72471.6568873653. The cubic root of 5252141052 is about 1738.2495555327.
Adding to 5252141052 its reverse (2501412525), we get a palindrome (7753553577).
The spelling of 5252141052 in words is "five billion, two hundred fifty-two million, one hundred forty-one thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •