Base | Representation |
---|---|
bin | 1001010101111000… |
… | …10100100111100101 |
3 | 110221112101220120111 |
4 | 10222330110213211 |
5 | 40232422022321 |
6 | 2145401533021 |
7 | 235200252556 |
oct | 45274244745 |
9 | 13845356514 |
10 | 5015423461 |
11 | 2144091974 |
12 | b7b7a4171 |
13 | 61c0cbbb9 |
14 | 35815832d |
15 | 1e54a15e1 |
hex | 12af149e5 |
5015423461 has 2 divisors, whose sum is σ = 5015423462. Its totient is φ = 5015423460.
The previous prime is 5015423459. The next prime is 5015423503. The reversal of 5015423461 is 1643245105.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4943496100 + 71927361 = 70310^2 + 8481^2 .
It is a cyclic number.
It is not a de Polignac number, because 5015423461 - 21 = 5015423459 is a prime.
Together with 5015423459, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5015426461) 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 as a sum of consecutive naturals, namely, 2507711730 + 2507711731.
It is an arithmetic number, because the mean of its divisors is an integer number (2507711731).
Almost surely, 25015423461 is an apocalyptic number.
It is an amenable number.
5015423461 is a deficient number, since it is larger than the sum of its proper divisors (1).
5015423461 is an equidigital number, since it uses as much as digits as its factorization.
5015423461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14400, while the sum is 31.
The square root of 5015423461 is about 70819.6544823540. The cubic root of 5015423461 is about 1711.7323917037.
Adding to 5015423461 its reverse (1643245105), we get a palindrome (6658668566).
The spelling of 5015423461 in words is "five billion, fifteen million, four hundred twenty-three thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •