Base | Representation |
---|---|
bin | 10010101101100011100… |
… | …100110110000010000001 |
3 | 11112221001012101221022102 |
4 | 102231203210312002001 |
5 | 132031423122340020 |
6 | 2422415115120145 |
7 | 161620645111322 |
oct | 22554344660201 |
9 | 4487035357272 |
10 | 1285865824385 |
11 | 45637280a91a |
12 | 189261a43055 |
13 | 94344a6a30c |
14 | 46344346449 |
15 | 236ad13b475 |
hex | 12b63936081 |
1285865824385 has 8 divisors (see below), whose sum is σ = 1558946608296. Its totient is φ = 1018087580160.
The previous prime is 1285865824301. The next prime is 1285865824387. The reversal of 1285865824385 is 5834285685821.
It can be written as a sum of positive squares in 4 ways, for example, as 121126273024 + 1164739551361 = 348032^2 + 1079231^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1285865824385 - 28 = 1285865824129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1285865824387) 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 in 7 ways as a sum of consecutive naturals, for example, 1325634386 + ... + 1325635355.
It is an arithmetic number, because the mean of its divisors is an integer number (194868326037).
Almost surely, 21285865824385 is an apocalyptic number.
It is an amenable number.
1285865824385 is a deficient number, since it is larger than the sum of its proper divisors (273080783911).
1285865824385 is an equidigital number, since it uses as much as digits as its factorization.
1285865824385 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2651269843.
The product of its digits is 147456000, while the sum is 65.
The spelling of 1285865824385 in words is "one trillion, two hundred eighty-five billion, eight hundred sixty-five million, eight hundred twenty-four thousand, three hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •