Base | Representation |
---|---|
bin | 1001010100011101… |
… | …01010111001100101 |
3 | 110220200212220102221 |
4 | 10222032222321211 |
5 | 40221341043401 |
6 | 2144253232341 |
7 | 234663450400 |
oct | 45216527145 |
9 | 13820786387 |
10 | 5003456101 |
11 | 2138358696 |
12 | b777926b1 |
13 | 61979ba17 |
14 | 356720d37 |
15 | 1e43da7a1 |
hex | 12a3aae65 |
5003456101 has 24 divisors (see below), whose sum is σ = 6036471000. Its totient is φ = 4130187264.
The previous prime is 5003456071. The next prime is 5003456147. The reversal of 5003456101 is 1016543005.
It can be written as a sum of positive squares in 4 ways, for example, as 1193357025 + 3810099076 = 34545^2 + 61726^2 .
It is a de Polignac number, because none of the positive numbers 2k-5003456101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5003456191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 576885 + ... + 585493.
It is an arithmetic number, because the mean of its divisors is an integer number (251519625).
Almost surely, 25003456101 is an apocalyptic number.
It is an amenable number.
5003456101 is a deficient number, since it is larger than the sum of its proper divisors (1033014899).
5003456101 is a wasteful number, since it uses less digits than its factorization.
5003456101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9061 (or 9054 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 25.
The square root of 5003456101 is about 70735.1122215834. The cubic root of 5003456101 is about 1710.3698459056.
Adding to 5003456101 its reverse (1016543005), we get a palindrome (6019999106).
The spelling of 5003456101 in words is "five billion, three million, four hundred fifty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •