Base | Representation |
---|---|
bin | 1001110000101010… |
… | …00001001110110101 |
3 | 111112011222122200012 |
4 | 10320111001032311 |
5 | 41212420021321 |
6 | 2223543230005 |
7 | 243565164122 |
oct | 47025011665 |
9 | 14464878605 |
10 | 5240001461 |
11 | 2249931722 |
12 | 1022a48305 |
13 | 6567b02a6 |
14 | 379cd7749 |
15 | 20a06305b |
hex | 1385413b5 |
5240001461 has 2 divisors, whose sum is σ = 5240001462. Its totient is φ = 5240001460.
The previous prime is 5240001449. The next prime is 5240001463. The reversal of 5240001461 is 1641000425.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4323062500 + 916938961 = 65750^2 + 30281^2 .
It is a cyclic number.
It is not a de Polignac number, because 5240001461 - 214 = 5239985077 is a prime.
It is a super-2 number, since 2×52400014612 = 54915230622564269042, which contains 22 as substring.
Together with 5240001463, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5240001463) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2620000730 + 2620000731.
It is an arithmetic number, because the mean of its divisors is an integer number (2620000731).
Almost surely, 25240001461 is an apocalyptic number.
It is an amenable number.
5240001461 is a deficient number, since it is larger than the sum of its proper divisors (1).
5240001461 is an equidigital number, since it uses as much as digits as its factorization.
5240001461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 960, while the sum is 23.
The square root of 5240001461 is about 72387.8543748881. The cubic root of 5240001461 is about 1736.9092819699.
Adding to 5240001461 its reverse (1641000425), we get a palindrome (6881001886).
The spelling of 5240001461 in words is "five billion, two hundred forty million, one thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •