Base | Representation |
---|---|
bin | 1000010111010010… |
… | …10011101100101101 |
3 | 102120221101011200202 |
4 | 10023221103230231 |
5 | 33144012022021 |
6 | 2021323403245 |
7 | 216163206413 |
oct | 41351235455 |
9 | 12527334622 |
10 | 4490345261 |
11 | 19a4756946 |
12 | a53983525 |
13 | 5673a613c |
14 | 3085152b3 |
15 | 1b4332a0b |
hex | 10ba53b2d |
4490345261 has 2 divisors, whose sum is σ = 4490345262. Its totient is φ = 4490345260.
The previous prime is 4490345179. The next prime is 4490345309. The reversal of 4490345261 is 1625430944.
4490345261 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4320564361 + 169780900 = 65731^2 + 13030^2 .
It is a cyclic number.
It is not a de Polignac number, because 4490345261 - 214 = 4490328877 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4490345161) 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, 2245172630 + 2245172631.
It is an arithmetic number, because the mean of its divisors is an integer number (2245172631).
Almost surely, 24490345261 is an apocalyptic number.
It is an amenable number.
4490345261 is a deficient number, since it is larger than the sum of its proper divisors (1).
4490345261 is an equidigital number, since it uses as much as digits as its factorization.
4490345261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 103680, while the sum is 38.
The square root of 4490345261 is about 67010.0385091667. The cubic root of 4490345261 is about 1649.7820662271.
The spelling of 4490345261 in words is "four billion, four hundred ninety million, three hundred forty-five thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •