Base | Representation |
---|---|
bin | 10010101011001001110… |
… | …001011000010011000001 |
3 | 11112200101100220202212001 |
4 | 102223021301120103001 |
5 | 132011132031403301 |
6 | 2421311100104001 |
7 | 161500003041202 |
oct | 22531161302301 |
9 | 4480340822761 |
10 | 1283285419201 |
11 | 455269189255 |
12 | 188861835001 |
13 | 94023298246 |
14 | 4617b7655a9 |
15 | 235ab82bc01 |
hex | 12ac9c584c1 |
1283285419201 has 4 divisors (see below), whose sum is σ = 1283301928404. Its totient is φ = 1283268910000.
The previous prime is 1283285419187. The next prime is 1283285419219. The reversal of 1283285419201 is 1029145823821.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 542439615025 + 740845804176 = 736505^2 + 860724^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1283285419201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1283285419231) 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 3 ways as a sum of consecutive naturals, for example, 8137450 + ... + 8293651.
It is an arithmetic number, because the mean of its divisors is an integer number (320825482101).
Almost surely, 21283285419201 is an apocalyptic number.
It is an amenable number.
1283285419201 is a deficient number, since it is larger than the sum of its proper divisors (16509203).
1283285419201 is an equidigital number, since it uses as much as digits as its factorization.
1283285419201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16509202.
The product of its (nonzero) digits is 276480, while the sum is 46.
The spelling of 1283285419201 in words is "one trillion, two hundred eighty-three billion, two hundred eighty-five million, four hundred nineteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •