Base | Representation |
---|---|
bin | 1001100000001101… |
… | …01100111001000001 |
3 | 111011120100222221221 |
4 | 10300012230321001 |
5 | 40422104433101 |
6 | 2202134115041 |
7 | 240301354126 |
oct | 46006547101 |
9 | 14146328857 |
10 | 5102030401 |
11 | 2188a65a56 |
12 | ba47aba81 |
13 | 634033600 |
14 | 36586074d |
15 | 1ecdacaa1 |
hex | 1301ace41 |
5102030401 has 6 divisors (see below), whose sum is σ = 5524683990. Its totient is φ = 4709566368.
The previous prime is 5102030387. The next prime is 5102030419. The reversal of 5102030401 is 1040302015.
It can be written as a sum of positive squares in 3 ways, for example, as 21762225 + 5080268176 = 4665^2 + 71276^2 .
It is not a de Polignac number, because 5102030401 - 211 = 5102028353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5102030441) 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 5 ways as a sum of consecutive naturals, for example, 15094596 + ... + 15094933.
It is an arithmetic number, because the mean of its divisors is an integer number (920780665).
Almost surely, 25102030401 is an apocalyptic number.
It is an amenable number.
5102030401 is a deficient number, since it is larger than the sum of its proper divisors (422653589).
5102030401 is a wasteful number, since it uses less digits than its factorization.
5102030401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30189555 (or 30189542 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 5102030401 is about 71428.4985212485. The cubic root of 5102030401 is about 1721.5290172496.
Adding to 5102030401 its reverse (1040302015), we get a palindrome (6142332416).
The spelling of 5102030401 in words is "five billion, one hundred two million, thirty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •