Base | Representation |
---|---|
bin | 1000011110011111… |
… | …10111100001100001 |
3 | 102202011002211121002 |
4 | 10033033313201201 |
5 | 33310000110441 |
6 | 2031323041345 |
7 | 220526015051 |
oct | 41717674141 |
9 | 12664084532 |
10 | 4550785121 |
11 | 1a25888243 |
12 | a70070255 |
13 | 576a7837c |
14 | 312569561 |
15 | 1b97c0b9b |
hex | 10f3f7861 |
4550785121 has 2 divisors, whose sum is σ = 4550785122. Its totient is φ = 4550785120.
The previous prime is 4550785111. The next prime is 4550785123. The reversal of 4550785121 is 1215870554.
4550785121 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., 3911251600 + 639533521 = 62540^2 + 25289^2 .
It is a cyclic number.
It is not a de Polignac number, because 4550785121 - 222 = 4546590817 is a prime.
It is a Sophie Germain prime.
Together with 4550785123, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (4550785123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2275392560 + 2275392561.
It is an arithmetic number, because the mean of its divisors is an integer number (2275392561).
Almost surely, 24550785121 is an apocalyptic number.
It is an amenable number.
4550785121 is a deficient number, since it is larger than the sum of its proper divisors (1).
4550785121 is an equidigital number, since it uses as much as digits as its factorization.
4550785121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56000, while the sum is 38.
The square root of 4550785121 is about 67459.5072691759. The cubic root of 4550785121 is about 1657.1511014336.
The spelling of 4550785121 in words is "four billion, five hundred fifty million, seven hundred eighty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •