Base | Representation |
---|---|
bin | 10100010000101010101… |
… | …110100001110011010011 |
3 | 11221002201211012101121002 |
4 | 110100222232201303103 |
5 | 140302400234302201 |
6 | 2543335114052215 |
7 | 202406102544443 |
oct | 24205256416323 |
9 | 4832654171532 |
10 | 1392286244051 |
11 | 49751331927a |
12 | 1a5a01a1a06b |
13 | a13a4786541 |
14 | 4b55bd74123 |
15 | 2633ad5776b |
hex | 1442aba1cd3 |
1392286244051 has 2 divisors, whose sum is σ = 1392286244052. Its totient is φ = 1392286244050.
The previous prime is 1392286244033. The next prime is 1392286244131. The reversal of 1392286244051 is 1504426822931.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1392286244051 - 230 = 1391212502227 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1392286243987 and 1392286244005.
It is not a weakly prime, because it can be changed into another prime (1392286244021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 696143122025 + 696143122026.
It is an arithmetic number, because the mean of its divisors is an integer number (696143122026).
Almost surely, 21392286244051 is an apocalyptic number.
1392286244051 is a deficient number, since it is larger than the sum of its proper divisors (1).
1392286244051 is an equidigital number, since it uses as much as digits as its factorization.
1392286244051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 829440, while the sum is 47.
The spelling of 1392286244051 in words is "one trillion, three hundred ninety-two billion, two hundred eighty-six million, two hundred forty-four thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •