Base | Representation |
---|---|
bin | 10100010000100111101… |
… | …111010011111111001001 |
3 | 11221002121022212201112020 |
4 | 110100213233103333021 |
5 | 140302244421233321 |
6 | 2543330123435053 |
7 | 202404623513313 |
oct | 24204757237711 |
9 | 4832538781466 |
10 | 1392236117961 |
11 | 497497aa1857 |
12 | 1a59a9085a89 |
13 | a1397285930 |
14 | 4b5554467b3 |
15 | 263367554c6 |
hex | 14427bd3fc9 |
1392236117961 has 128 divisors (see below), whose sum is σ = 2192259686400. Its totient is φ = 778117570560.
The previous prime is 1392236117959. The next prime is 1392236117999. The reversal of 1392236117961 is 1697116322931.
It is a happy number.
It is not a de Polignac number, because 1392236117961 - 21 = 1392236117959 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is not an unprimeable number, because it can be changed into a prime (1392236117861) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 1716690246 + ... + 1716691056.
It is an arithmetic number, because the mean of its divisors is an integer number (17127028800).
Almost surely, 21392236117961 is an apocalyptic number.
It is an amenable number.
1392236117961 is a deficient number, since it is larger than the sum of its proper divisors (800023568439).
1392236117961 is a wasteful number, since it uses less digits than its factorization.
1392236117961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1599.
The product of its digits is 734832, while the sum is 51.
The spelling of 1392236117961 in words is "one trillion, three hundred ninety-two billion, two hundred thirty-six million, one hundred seventeen thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •