Base | Representation |
---|---|
bin | 100000011100000011011… |
… | …1101110101111100000101 |
3 | 120210012122002200122110222 |
4 | 1000320012331311330011 |
5 | 1041021040442201021 |
6 | 13252040025554125 |
7 | 640046440424234 |
oct | 100700675657405 |
9 | 16705562618428 |
10 | 4458292928261 |
11 | 146982a148837 |
12 | 600069345945 |
13 | 26455230c923 |
14 | 115ad538cb1b |
15 | 7ae853076ab |
hex | 40e06f75f05 |
4458292928261 has 2 divisors, whose sum is σ = 4458292928262. Its totient is φ = 4458292928260.
The previous prime is 4458292928233. The next prime is 4458292928263. The reversal of 4458292928261 is 1628292928544.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4378200532225 + 80092396036 = 2092415^2 + 283006^2 .
It is a cyclic number.
It is not a de Polignac number, because 4458292928261 - 218 = 4458292666117 is a prime.
Together with 4458292928263, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 4458292928194 and 4458292928203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4458292928263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2229146464130 + 2229146464131.
It is an arithmetic number, because the mean of its divisors is an integer number (2229146464131).
Almost surely, 24458292928261 is an apocalyptic number.
It is an amenable number.
4458292928261 is a deficient number, since it is larger than the sum of its proper divisors (1).
4458292928261 is an equidigital number, since it uses as much as digits as its factorization.
4458292928261 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 39813120, while the sum is 62.
The spelling of 4458292928261 in words is "four trillion, four hundred fifty-eight billion, two hundred ninety-two million, nine hundred twenty-eight thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •