Base | Representation |
---|---|
bin | 10100010000110001010… |
… | …111001001011111101011 |
3 | 11221010000120122121110102 |
4 | 110100301113021133223 |
5 | 140303112233240231 |
6 | 2543354131540015 |
7 | 202411623641252 |
oct | 24206127113753 |
9 | 4833016577412 |
10 | 1392397555691 |
11 | 49757013636a |
12 | 1a5a3315a60b |
13 | a13c185a90c |
14 | 4b56ca6b799 |
15 | 263459e3acb |
hex | 144315c97eb |
1392397555691 has 2 divisors, whose sum is σ = 1392397555692. Its totient is φ = 1392397555690.
The previous prime is 1392397555669. The next prime is 1392397555697. The reversal of 1392397555691 is 1965557932931.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1392397555691 is a prime.
It is not a weakly prime, because it can be changed into another prime (1392397555697) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 696198777845 + 696198777846.
It is an arithmetic number, because the mean of its divisors is an integer number (696198777846).
Almost surely, 21392397555691 is an apocalyptic number.
1392397555691 is a deficient number, since it is larger than the sum of its proper divisors (1).
1392397555691 is an equidigital number, since it uses as much as digits as its factorization.
1392397555691 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 68890500, while the sum is 65.
The spelling of 1392397555691 in words is "one trillion, three hundred ninety-two billion, three hundred ninety-seven million, five hundred fifty-five thousand, six hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •