Base | Representation |
---|---|
bin | 1100101011010111010101… |
… | …0011101001011101101111 |
3 | 1211100120100102101012012110 |
4 | 3022311311103221131233 |
5 | 3311334323030212432 |
6 | 45351315012535103 |
7 | 2636032544142243 |
oct | 312656523513557 |
9 | 54316312335173 |
10 | 13939136960367 |
11 | 4494611470133 |
12 | 16915b8921493 |
13 | 7a15bb771528 |
14 | 36292d120423 |
15 | 1928c7a1edcc |
hex | cad754e976f |
13939136960367 has 16 divisors (see below), whose sum is σ = 18647758908000. Its totient is φ = 9261677474304.
The previous prime is 13939136960341. The next prime is 13939136960381. The reversal of 13939136960367 is 76306963193931.
It is not a de Polignac number, because 13939136960367 - 216 = 13939136894831 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13939136960298 and 13939136960307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13939136960327) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3761142 + ... + 6482627.
It is an arithmetic number, because the mean of its divisors is an integer number (1165484931750).
Almost surely, 213939136960367 is an apocalyptic number.
13939136960367 is a deficient number, since it is larger than the sum of its proper divisors (4708621947633).
13939136960367 is a wasteful number, since it uses less digits than its factorization.
13939136960367 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10245290.
The product of its (nonzero) digits is 89282088, while the sum is 66.
The spelling of 13939136960367 in words is "thirteen trillion, nine hundred thirty-nine billion, one hundred thirty-six million, nine hundred sixty thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •