Base | Representation |
---|---|
bin | 1001100100111111… |
… | …11111100111101110 |
3 | 111021100222121001222 |
4 | 10302133333213232 |
5 | 41012401341100 |
6 | 2210131303342 |
7 | 241300051622 |
oct | 46237774756 |
9 | 14240877058 |
10 | 5142215150 |
11 | 21a9712396 |
12 | bb614ab52 |
13 | 63c463277 |
14 | 36ad21182 |
15 | 201699485 |
hex | 1327ff9ee |
5142215150 has 24 divisors (see below), whose sum is σ = 9589791720. Its totient is φ = 2051451360.
The previous prime is 5142215147. The next prime is 5142215153. The reversal of 5142215150 is 515122415.
It is an interprime number because it is at equal distance from previous prime (5142215147) and next prime (5142215153).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5142215153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 116729 + ... + 154628.
It is an arithmetic number, because the mean of its divisors is an integer number (399574655).
Almost surely, 25142215150 is an apocalyptic number.
5142215150 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5142215150 is a deficient number, since it is larger than the sum of its proper divisors (4447576570).
5142215150 is a wasteful number, since it uses less digits than its factorization.
5142215150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271748 (or 271743 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 26.
The square root of 5142215150 is about 71709.2403390246. The cubic root of 5142215150 is about 1726.0369205017.
Adding to 5142215150 its reverse (515122415), we get a palindrome (5657337565).
The spelling of 5142215150 in words is "five billion, one hundred forty-two million, two hundred fifteen thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •