Base | Representation |
---|---|
bin | 10100010001101100111… |
… | …010100111001010100001 |
3 | 11221012121012201210202112 |
4 | 110101230322213022201 |
5 | 140312134024124001 |
6 | 2544041223125105 |
7 | 202445445411614 |
oct | 24215472471241 |
9 | 4835535653675 |
10 | 1393396708001 |
11 | 497a33130281 |
12 | 1a60718a3795 |
13 | a152085bcbc |
14 | 4b62563817b |
15 | 263a35a8cbb |
hex | 1446cea72a1 |
1393396708001 has 8 divisors (see below), whose sum is σ = 1446935174664. Its totient is φ = 1340789345280.
The previous prime is 1393396707917. The next prime is 1393396708007. The reversal of 1393396708001 is 1008076933931.
It can be written as a sum of positive squares in 4 ways, for example, as 52548001 + 1393344160000 = 7249^2 + 1180400^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1393396708001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1393396708007) 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 in 7 ways as a sum of consecutive naturals, for example, 232772936 + ... + 232778921.
It is an arithmetic number, because the mean of its divisors is an integer number (180866896833).
Almost surely, 21393396708001 is an apocalyptic number.
It is an amenable number.
1393396708001 is a deficient number, since it is larger than the sum of its proper divisors (53538466663).
1393396708001 is an equidigital number, since it uses as much as digits as its factorization.
1393396708001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 465551971.
The product of its (nonzero) digits is 734832, while the sum is 50.
The spelling of 1393396708001 in words is "one trillion, three hundred ninety-three billion, three hundred ninety-six million, seven hundred eight thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •