Base | Representation |
---|---|
bin | 10100010000101001000… |
… | …110110010101000001111 |
3 | 11221002122221000210100222 |
4 | 110100221012302220033 |
5 | 140302321304044444 |
6 | 2543332303141555 |
7 | 202405322443466 |
oct | 24205106625017 |
9 | 4832587023328 |
10 | 1392259049999 |
11 | 4974a9a34a54 |
12 | 1a59b48a48bb |
13 | a139bc5479c |
14 | 4b5584d59dd |
15 | 26338784eee |
hex | 144291b2a0f |
1392259049999 has 2 divisors, whose sum is σ = 1392259050000. Its totient is φ = 1392259049998.
The previous prime is 1392259049983. The next prime is 1392259050113. The reversal of 1392259049999 is 9999409522931.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1392259049999 - 24 = 1392259049983 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1392259049299) 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 as a sum of consecutive naturals, namely, 696129524999 + 696129525000.
It is an arithmetic number, because the mean of its divisors is an integer number (696129525000).
Almost surely, 21392259049999 is an apocalyptic number.
1392259049999 is a deficient number, since it is larger than the sum of its proper divisors (1).
1392259049999 is an equidigital number, since it uses as much as digits as its factorization.
1392259049999 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 127545840, while the sum is 71.
The spelling of 1392259049999 in words is "one trillion, three hundred ninety-two billion, two hundred fifty-nine million, forty-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •