Base | Representation |
---|---|
bin | 1001010110111011… |
… | …11101100110110101 |
3 | 110222010222221110210 |
4 | 10223131331212311 |
5 | 40242201221401 |
6 | 2150314540033 |
7 | 235335232104 |
oct | 45335754665 |
9 | 13863887423 |
10 | 5024242101 |
11 | 21490654aa |
12 | b82737619 |
13 | 620b98b28 |
14 | 3593b203b |
15 | 1e61444d6 |
hex | 12b77d9b5 |
5024242101 has 8 divisors (see below), whose sum is σ = 7093047744. Its totient is φ = 3152465600.
The previous prime is 5024242081. The next prime is 5024242109. The reversal of 5024242101 is 1012424205.
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 5024242101 - 29 = 5024241589 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5024242109) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 49257225 + ... + 49257326.
It is an arithmetic number, because the mean of its divisors is an integer number (886630968).
Almost surely, 25024242101 is an apocalyptic number.
5024242101 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
It is an amenable number.
5024242101 is a deficient number, since it is larger than the sum of its proper divisors (2068805643).
5024242101 is a wasteful number, since it uses less digits than its factorization.
5024242101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98514571.
The product of its (nonzero) digits is 640, while the sum is 21.
The square root of 5024242101 is about 70881.8883848335. Note that the first 3 decimals coincide. The cubic root of 5024242101 is about 1712.7350530076.
Adding to 5024242101 its reverse (1012424205), we get a palindrome (6036666306).
The spelling of 5024242101 in words is "five billion, twenty-four million, two hundred forty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •