Base | Representation |
---|---|
bin | 11101100110101111000101… |
… | …010101100100000001001011 |
3 | 122002000111111100110011111222 |
4 | 131212233011111210001023 |
5 | 114031240320022423342 |
6 | 1140531244040312255 |
7 | 36266006222632346 |
oct | 3546570525440113 |
9 | 562014440404458 |
10 | 130205244342347 |
11 | 3853a808a95459 |
12 | 1272a794a7268b |
13 | 57863c02443c5 |
14 | 2421d7898745d |
15 | 100be0d13bed2 |
hex | 766bc556404b |
130205244342347 has 2 divisors, whose sum is σ = 130205244342348. Its totient is φ = 130205244342346.
The previous prime is 130205244342281. The next prime is 130205244342451. The reversal of 130205244342347 is 743243442502031.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 130205244342347 - 214 = 130205244325963 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130205244342298 and 130205244342307.
It is not a weakly prime, because it can be changed into another prime (130205244312347) 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 as a sum of consecutive naturals, namely, 65102622171173 + 65102622171174.
It is an arithmetic number, because the mean of its divisors is an integer number (65102622171174).
Almost surely, 2130205244342347 is an apocalyptic number.
130205244342347 is a deficient number, since it is larger than the sum of its proper divisors (1).
130205244342347 is an equidigital number, since it uses as much as digits as its factorization.
130205244342347 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1935360, while the sum is 44.
Adding to 130205244342347 its reverse (743243442502031), we get a palindrome (873448686844378).
The spelling of 130205244342347 in words is "one hundred thirty trillion, two hundred five billion, two hundred forty-four million, three hundred forty-two thousand, three hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •