Base | Representation |
---|---|
bin | 1001010100001101… |
… | …00101001000000111 |
3 | 110220112220011020212 |
4 | 10222012211020013 |
5 | 40220320212203 |
6 | 2144135550035 |
7 | 234636435326 |
oct | 45206451007 |
9 | 13815804225 |
10 | 5001335303 |
11 | 213713a268 |
12 | b76b2b31b |
13 | 619208603 |
14 | 35632c0bd |
15 | 1e411c1d8 |
hex | 12a1a5207 |
5001335303 has 8 divisors (see below), whose sum is σ = 5225589600. Its totient is φ = 4777648128.
The previous prime is 5001335293. The next prime is 5001335309. The reversal of 5001335303 is 3035331005.
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 5001335303 - 214 = 5001318919 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5001335309) 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 7 ways as a sum of consecutive naturals, for example, 123698 + ... + 159071.
It is an arithmetic number, because the mean of its divisors is an integer number (653198700).
Almost surely, 25001335303 is an apocalyptic number.
5001335303 is a deficient number, since it is larger than the sum of its proper divisors (224254297).
5001335303 is a wasteful number, since it uses less digits than its factorization.
5001335303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283561.
The product of its (nonzero) digits is 2025, while the sum is 23.
The square root of 5001335303 is about 70720.1195064036. The cubic root of 5001335303 is about 1710.1281555286.
Adding to 5001335303 its reverse (3035331005), we get a palindrome (8036666308).
The spelling of 5001335303 in words is "five billion, one million, three hundred thirty-five thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •