Base | Representation |
---|---|
bin | 1011111001010111000111… |
… | …1000010001100010100111 |
3 | 1201022102222200102112101001 |
4 | 2332111301320101202213 |
5 | 3203301004003244024 |
6 | 43452524125214131 |
7 | 2520001503331330 |
oct | 276256170214247 |
9 | 51272880375331 |
10 | 13080085993639 |
11 | 41932626010a5 |
12 | 1573012401347 |
13 | 73b5a686b732 |
14 | 333118387287 |
15 | 17a39a490244 |
hex | be571e118a7 |
13080085993639 has 8 divisors (see below), whose sum is σ = 15008226162048. Its totient is φ = 11166834939000.
The previous prime is 13080085993549. The next prime is 13080085993643. The reversal of 13080085993639 is 93639958008031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13080085993639 - 215 = 13080085960871 is a prime.
It is a super-2 number, since 2×130800859936392 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13080085993439) 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 7 ways as a sum of consecutive naturals, for example, 3722276557 + ... + 3722280070.
It is an arithmetic number, because the mean of its divisors is an integer number (1876028270256).
Almost surely, 213080085993639 is an apocalyptic number.
13080085993639 is a deficient number, since it is larger than the sum of its proper divisors (1928140168409).
13080085993639 is an equidigital number, since it uses as much as digits as its factorization.
13080085993639 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7444556885.
The product of its (nonzero) digits is 37791360, while the sum is 64.
The spelling of 13080085993639 in words is "thirteen trillion, eighty billion, eighty-five million, nine hundred ninety-three thousand, six hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •