Base | Representation |
---|---|
bin | 100000010110001… |
… | …0011101101001001 |
3 | 2210122021211201201 |
4 | 1000230103231021 |
5 | 4210322404443 |
6 | 255410544201 |
7 | 35616244516 |
oct | 10054235511 |
9 | 2718254651 |
10 | 1085356873 |
11 | 507723757 |
12 | 263598061 |
13 | 143b24903 |
14 | a420a30d |
15 | 6544234d |
hex | 40b13b49 |
1085356873 has 4 divisors (see below), whose sum is σ = 1085432980. Its totient is φ = 1085280768.
The previous prime is 1085356849. The next prime is 1085356889. The reversal of 1085356873 is 3786535801.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 402684489 + 682672384 = 20067^2 + 26128^2 .
It is a cyclic number.
It is not a de Polignac number, because 1085356873 - 221 = 1083259721 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1085356373) 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 in 3 ways as a sum of consecutive naturals, for example, 9540 + ... + 47557.
It is an arithmetic number, because the mean of its divisors is an integer number (271358245).
Almost surely, 21085356873 is an apocalyptic number.
It is an amenable number.
1085356873 is a deficient number, since it is larger than the sum of its proper divisors (76107).
1085356873 is an equidigital number, since it uses as much as digits as its factorization.
1085356873 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76106.
The product of its (nonzero) digits is 604800, while the sum is 46.
The square root of 1085356873 is about 32944.7548632555. The cubic root of 1085356873 is about 1027.6790903450.
The spelling of 1085356873 in words is "one billion, eighty-five million, three hundred fifty-six thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •