Base | Representation |
---|---|
bin | 11101101000011111110101… |
… | …001101000101110110000111 |
3 | 122002110001222101021121012221 |
4 | 131220133311031011312013 |
5 | 114040231233431343023 |
6 | 1141103024554553211 |
7 | 36310523240251141 |
oct | 3550376515056607 |
9 | 562401871247187 |
10 | 130326306512263 |
11 | 38587092476554 |
12 | 1274a140438807 |
13 | 57949444c5484 |
14 | 2427b80dc1c91 |
15 | 10101464a485d |
hex | 7687f5345d87 |
130326306512263 has 8 divisors (see below), whose sum is σ = 133394235267488. Its totient is φ = 127293043618944.
The previous prime is 130326306512239. The next prime is 130326306512287. The reversal of 130326306512263 is 362215603623031.
It is an interprime number because it is at equal distance from previous prime (130326306512239) and next prime (130326306512287).
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 130326306512263 - 213 = 130326306504071 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130326306512203) 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, 8666457870 + ... + 8666472907.
It is an arithmetic number, because the mean of its divisors is an integer number (16674279408436).
Almost surely, 2130326306512263 is an apocalyptic number.
130326306512263 is a deficient number, since it is larger than the sum of its proper divisors (3067928755225).
130326306512263 is a wasteful number, since it uses less digits than its factorization.
130326306512263 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17332930953.
The product of its (nonzero) digits is 699840, while the sum is 43.
The spelling of 130326306512263 in words is "one hundred thirty trillion, three hundred twenty-six billion, three hundred six million, five hundred twelve thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •