Base | Representation |
---|---|
bin | 10100010000110001011… |
… | …111000101100000000001 |
3 | 11221010000201120022202201 |
4 | 110100301133011200001 |
5 | 140303113301331411 |
6 | 2543354244313201 |
7 | 202411650425560 |
oct | 24206137054001 |
9 | 4833021508681 |
10 | 1392399636481 |
11 | 497571327727 |
12 | 1a5a339a2801 |
13 | a13c2108a59 |
14 | 4b56d04dbd7 |
15 | 26345ca53c1 |
hex | 144317c5801 |
1392399636481 has 4 divisors (see below), whose sum is σ = 1591313870272. Its totient is φ = 1193485402692.
The previous prime is 1392399636457. The next prime is 1392399636493. The reversal of 1392399636481 is 1846369932931.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1392399636481 - 213 = 1392399628289 is a prime.
It is a super-2 number, since 2×13923996364812 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1392399639481) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 99457116885 + ... + 99457116898.
It is an arithmetic number, because the mean of its divisors is an integer number (397828467568).
Almost surely, 21392399636481 is an apocalyptic number.
It is an amenable number.
1392399636481 is a deficient number, since it is larger than the sum of its proper divisors (198914233791).
1392399636481 is an equidigital number, since it uses as much as digits as its factorization.
1392399636481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198914233790.
The product of its digits is 45349632, while the sum is 64.
The spelling of 1392399636481 in words is "one trillion, three hundred ninety-two billion, three hundred ninety-nine million, six hundred thirty-six thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •