Base | Representation |
---|---|
bin | 100000010110111… |
… | …0101000000011101 |
3 | 2210200001002102202 |
4 | 1000231311000131 |
5 | 4210423133141 |
6 | 255423301245 |
7 | 35622524462 |
oct | 10055650035 |
9 | 2720032382 |
10 | 1085755421 |
11 | 507976133 |
12 | 26374a825 |
13 | 143c3413a |
14 | a42b1669 |
15 | 654c049b |
hex | 40b7501d |
1085755421 has 2 divisors, whose sum is σ = 1085755422. Its totient is φ = 1085755420.
The previous prime is 1085755367. The next prime is 1085755423. The reversal of 1085755421 is 1245575801.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1055340196 + 30415225 = 32486^2 + 5515^2 .
It is an emirp because it is prime and its reverse (1245575801) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1085755421 is a prime.
Together with 1085755423, 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 (1085755423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 542877710 + 542877711.
It is an arithmetic number, because the mean of its divisors is an integer number (542877711).
Almost surely, 21085755421 is an apocalyptic number.
It is an amenable number.
1085755421 is a deficient number, since it is larger than the sum of its proper divisors (1).
1085755421 is an equidigital number, since it uses as much as digits as its factorization.
1085755421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56000, while the sum is 38.
The square root of 1085755421 is about 32950.8030402902. The cubic root of 1085755421 is about 1027.8048644363.
The spelling of 1085755421 in words is "one billion, eighty-five million, seven hundred fifty-five thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •