Base | Representation |
---|---|
bin | 1001110010000110… |
… | …01110100010111110 |
3 | 111120000210001210210 |
4 | 10321003032202332 |
5 | 41224020131442 |
6 | 2225055013250 |
7 | 244103144346 |
oct | 47103164276 |
9 | 14500701723 |
10 | 5252114622 |
11 | 22557554a7 |
12 | 1026b0a226 |
13 | 659161941 |
14 | 37b76bd26 |
15 | 20b15719c |
hex | 1390ce8be |
5252114622 has 8 divisors (see below), whose sum is σ = 10504229256. Its totient is φ = 1750704872.
The previous prime is 5252114603. The next prime is 5252114627. The reversal of 5252114622 is 2264112525.
It is a sphenic number, since it is the product of 3 distinct primes.
5252114622 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 5252114622.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5252114627) 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 3 ways as a sum of consecutive naturals, for example, 437676213 + ... + 437676224.
It is an arithmetic number, because the mean of its divisors is an integer number (1313028657).
Almost surely, 25252114622 is an apocalyptic number.
5252114622 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5252114622 is a wasteful number, since it uses less digits than its factorization.
5252114622 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 875352442.
The product of its digits is 9600, while the sum is 30.
The square root of 5252114622 is about 72471.4745399871. The cubic root of 5252114622 is about 1738.2466397686.
The spelling of 5252114622 in words is "five billion, two hundred fifty-two million, one hundred fourteen thousand, six hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •