Base | Representation |
---|---|
bin | 11101101111101010001000… |
… | …111001001011101100101101 |
3 | 122011012010011221221001120211 |
4 | 131233222020321023230231 |
5 | 114121312101102434234 |
6 | 1142121052001142421 |
7 | 36361214111030113 |
oct | 3557521071135455 |
9 | 564163157831524 |
10 | 130818410593069 |
11 | 3875685a394aa1 |
12 | 1280959902aa11 |
13 | 57cc17a8421c4 |
14 | 24439056b1ab3 |
15 | 101cd48ceb164 |
hex | 76fa88e4bb2d |
130818410593069 has 8 divisors (see below), whose sum is σ = 131028945506048. Its totient is φ = 130607885857680.
The previous prime is 130818410593033. The next prime is 130818410593093. The reversal of 130818410593069 is 960395014818031.
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 130818410593069 - 29 = 130818410592557 is a prime.
It is a super-2 number, since 2×1308184105930692 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130818410593019) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23396044 + ... + 28443130.
It is an arithmetic number, because the mean of its divisors is an integer number (16378618188256).
Almost surely, 2130818410593069 is an apocalyptic number.
It is an amenable number.
130818410593069 is a deficient number, since it is larger than the sum of its proper divisors (210534912979).
130818410593069 is an equidigital number, since it uses as much as digits as its factorization.
130818410593069 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5088795.
The product of its (nonzero) digits is 5598720, while the sum is 58.
The spelling of 130818410593069 in words is "one hundred thirty trillion, eight hundred eighteen billion, four hundred ten million, five hundred ninety-three thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •