Base | Representation |
---|---|
bin | 1001100000001000… |
… | …10100010000111001 |
3 | 111011112012020101212 |
4 | 10300010110100321 |
5 | 40421424431431 |
6 | 2202112452505 |
7 | 240263141402 |
oct | 46004242071 |
9 | 14145166355 |
10 | 5101405241 |
11 | 2188679299 |
12 | ba454a135 |
13 | 633b74baa |
14 | 36573a9a9 |
15 | 1eccd772b |
hex | 130114439 |
5101405241 has 4 divisors (see below), whose sum is σ = 5101936272. Its totient is φ = 5100874212.
The previous prime is 5101405213. The next prime is 5101405249. The reversal of 5101405241 is 1425041015.
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.
It is a cyclic number.
It is not a de Polignac number, because 5101405241 - 214 = 5101388857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5101405249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 250835 + ... + 270408.
It is an arithmetic number, because the mean of its divisors is an integer number (1275484068).
Almost surely, 25101405241 is an apocalyptic number.
It is an amenable number.
5101405241 is a deficient number, since it is larger than the sum of its proper divisors (531031).
5101405241 is an equidigital number, since it uses as much as digits as its factorization.
5101405241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 531030.
The product of its (nonzero) digits is 800, while the sum is 23.
The square root of 5101405241 is about 71424.1222627202. The cubic root of 5101405241 is about 1721.4587004700.
Adding to 5101405241 its reverse (1425041015), we get a palindrome (6526446256).
The spelling of 5101405241 in words is "five billion, one hundred one million, four hundred five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •