Base | Representation |
---|---|
bin | 1001010100001011… |
… | …10110000100000110 |
3 | 110220112112100211021 |
4 | 10222011312010012 |
5 | 40220243030114 |
6 | 2144131501354 |
7 | 234635003323 |
oct | 45205660406 |
9 | 13815470737 |
10 | 5001142534 |
11 | 2137018453 |
12 | b76a5785a |
13 | 61916b94b |
14 | 3562bbb4a |
15 | 1e40d0024 |
hex | 12a176106 |
5001142534 has 8 divisors (see below), whose sum is σ = 7502955768. Its totient is φ = 2500157280.
The previous prime is 5001142459. The next prime is 5001142537. The reversal of 5001142534 is 4352411005.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×50011425342 = 50022853290767882312, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5001142499 and 5001142508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5001142537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 191667 + ... + 216190.
It is an arithmetic number, because the mean of its divisors is an integer number (937869471).
Almost surely, 25001142534 is an apocalyptic number.
5001142534 is a deficient number, since it is larger than the sum of its proper divisors (2501813234).
5001142534 is a wasteful number, since it uses less digits than its factorization.
5001142534 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 413990.
The product of its (nonzero) digits is 2400, while the sum is 25.
The square root of 5001142534 is about 70718.7565925759. The cubic root of 5001142534 is about 1710.1061838011.
Adding to 5001142534 its reverse (4352411005), we get a palindrome (9353553539).
The spelling of 5001142534 in words is "five billion, one million, one hundred forty-two thousand, five hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •