Base | Representation |
---|---|
bin | 1000110110000110… |
… | …00001101111101101 |
3 | 110020221121021110201 |
4 | 10123003001233231 |
5 | 34211134330314 |
6 | 2103114033501 |
7 | 225451446451 |
oct | 43303015755 |
9 | 13227537421 |
10 | 4748745709 |
11 | 20175a7a34 |
12 | b06418891 |
13 | 5a8a9a306 |
14 | 33097a661 |
15 | 1cbd75b74 |
hex | 11b0c1bed |
4748745709 has 2 divisors, whose sum is σ = 4748745710. Its totient is φ = 4748745708.
The previous prime is 4748745691. The next prime is 4748745719. The reversal of 4748745709 is 9075478474.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4748588100 + 157609 = 68910^2 + 397^2 .
It is a cyclic number.
It is not a de Polignac number, because 4748745709 - 225 = 4715191277 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4748745709.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4748745719) 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, 2374372854 + 2374372855.
It is an arithmetic number, because the mean of its divisors is an integer number (2374372855).
Almost surely, 24748745709 is an apocalyptic number.
It is an amenable number.
4748745709 is a deficient number, since it is larger than the sum of its proper divisors (1).
4748745709 is an equidigital number, since it uses as much as digits as its factorization.
4748745709 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7902720, while the sum is 55.
The square root of 4748745709 is about 68911.1435763477. The cubic root of 4748745709 is about 1680.8397291285.
The spelling of 4748745709 in words is "four billion, seven hundred forty-eight million, seven hundred forty-five thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •