Base | Representation |
---|---|
bin | 111100111110111000… |
… | …0010110110100011111 |
3 | 110112000202011201210102 |
4 | 1321331300112310133 |
5 | 4121200431103023 |
6 | 140054530331315 |
7 | 12314165556266 |
oct | 1717560266437 |
9 | 415022151712 |
10 | 130958847263 |
11 | 505a2945292 |
12 | 21469a29b3b |
13 | c47073358a |
14 | 64a49835dd |
15 | 3617116628 |
hex | 1e7dc16d1f |
130958847263 has 2 divisors, whose sum is σ = 130958847264. Its totient is φ = 130958847262.
The previous prime is 130958847259. The next prime is 130958847269. The reversal of 130958847263 is 362748859031.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 130958847263 - 22 = 130958847259 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130958847199 and 130958847208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130958847269) 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, 65479423631 + 65479423632.
It is an arithmetic number, because the mean of its divisors is an integer number (65479423632).
It is a 1-persistent number, because it is pandigital, but 2⋅130958847263 = 261917694526 is not.
Almost surely, 2130958847263 is an apocalyptic number.
130958847263 is a deficient number, since it is larger than the sum of its proper divisors (1).
130958847263 is an equidigital number, since it uses as much as digits as its factorization.
130958847263 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8709120, while the sum is 56.
The spelling of 130958847263 in words is "one hundred thirty billion, nine hundred fifty-eight million, eight hundred forty-seven thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •