Base | Representation |
---|---|
bin | 1001100100111111… |
… | …01011010110010011 |
3 | 111021100211101011121 |
4 | 10302133223112103 |
5 | 41012341211430 |
6 | 2210125423111 |
7 | 241266254551 |
oct | 46237532623 |
9 | 14240741147 |
10 | 5142132115 |
11 | 21a9665a6a |
12 | bb610aa97 |
13 | 63c434533 |
14 | 36acdcbd1 |
15 | 20167ea7a |
hex | 1327eb593 |
5142132115 has 8 divisors (see below), whose sum is σ = 6184617120. Its totient is φ = 4104333312.
The previous prime is 5142132097. The next prime is 5142132119. The reversal of 5142132115 is 5112312415.
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 5142132115 - 231 = 2994648467 is a prime.
It is a super-2 number, since 2×51421321152 = 52883045376228746450, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5142132115.
It is not an unprimeable number, because it can be changed into a prime (5142132119) 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, 1169134 + ... + 1173523.
It is an arithmetic number, because the mean of its divisors is an integer number (773077140).
Almost surely, 25142132115 is an apocalyptic number.
5142132115 is a deficient number, since it is larger than the sum of its proper divisors (1042485005).
5142132115 is a wasteful number, since it uses less digits than its factorization.
5142132115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2343101.
The product of its digits is 1200, while the sum is 25.
The square root of 5142132115 is about 71708.6613666717. The cubic root of 5142132115 is about 1726.0276299370.
The spelling of 5142132115 in words is "five billion, one hundred forty-two million, one hundred thirty-two thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •