Base | Representation |
---|---|
bin | 1001010100010011… |
… | …00011100100001101 |
3 | 110220121100210021011 |
4 | 10222021203210031 |
5 | 40221020142331 |
6 | 2144204405221 |
7 | 234646164436 |
oct | 45211434415 |
9 | 13817323234 |
10 | 5002115341 |
11 | 2137622323 |
12 | b77246811 |
13 | 61941c682 |
14 | 35649248d |
15 | 1e42233b1 |
hex | 12a26390d |
5002115341 has 4 divisors (see below), whose sum is σ = 5002256800. Its totient is φ = 5001973884.
The previous prime is 5002115323. The next prime is 5002115347. The reversal of 5002115341 is 1435112005.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 5002115341 - 27 = 5002115213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5002115347) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 34330 + ... + 105748.
It is an arithmetic number, because the mean of its divisors is an integer number (1250564200).
Almost surely, 25002115341 is an apocalyptic number.
It is an amenable number.
5002115341 is a deficient number, since it is larger than the sum of its proper divisors (141459).
5002115341 is an equidigital number, since it uses as much as digits as its factorization.
5002115341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 141458.
The product of its (nonzero) digits is 600, while the sum is 22.
The square root of 5002115341 is about 70725.6342566117. The cubic root of 5002115341 is about 1710.2170581596.
Adding to 5002115341 its reverse (1435112005), we get a palindrome (6437227346).
The spelling of 5002115341 in words is "five billion, two million, one hundred fifteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •