Base | Representation |
---|---|
bin | 11101100110111100111100… |
… | …101101110110100011110111 |
3 | 122002001220220220101122010021 |
4 | 131212330330231312203313 |
5 | 114032011312304202333 |
6 | 1140542145224510011 |
7 | 36300044160531535 |
oct | 3546747455664367 |
9 | 562056826348107 |
10 | 130220132100343 |
11 | 3854605881438a |
12 | 1273164a91b307 |
13 | 578792375176c |
14 | 242298bd11155 |
15 | 100c4d017e82d |
hex | 766f3cb768f7 |
130220132100343 has 16 divisors (see below), whose sum is σ = 135941968320480. Its totient is φ = 124627542281856.
The previous prime is 130220132100313. The next prime is 130220132100391. The reversal of 130220132100343 is 343001231022031.
It is a cyclic number.
It is not a de Polignac number, because 130220132100343 - 213 = 130220132092151 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 (130220132100313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 91880080 + ... + 93286597.
It is an arithmetic number, because the mean of its divisors is an integer number (8496373020030).
Almost surely, 2130220132100343 is an apocalyptic number.
130220132100343 is a deficient number, since it is larger than the sum of its proper divisors (5721836220137).
130220132100343 is a wasteful number, since it uses less digits than its factorization.
130220132100343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185167026.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 130220132100343 its reverse (343001231022031), we get a palindrome (473221363122374).
The spelling of 130220132100343 in words is "one hundred thirty trillion, two hundred twenty billion, one hundred thirty-two million, one hundred thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •