Base | Representation |
---|---|
bin | 11101100110000010101001… |
… | …110001110001010110010001 |
3 | 122001211221100120022002000211 |
4 | 131212002221301301112101 |
5 | 114030000114024202143 |
6 | 1140453314105444121 |
7 | 36262400053023412 |
oct | 3546025161612621 |
9 | 561757316262024 |
10 | 130157537334673 |
11 | 38521557697492 |
12 | 1272149baa0641 |
13 | 5781a59564c94 |
14 | 241d9309bd809 |
15 | 100aa69c3249d |
hex | 7660a9c71591 |
130157537334673 has 4 divisors (see below), whose sum is σ = 137813863060260. Its totient is φ = 122501211609088.
The previous prime is 130157537334667. The next prime is 130157537334757. The reversal of 130157537334673 is 376433735751031.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 116027215757649 + 14130321577024 = 10771593^2 + 3759032^2 .
It is not a de Polignac number, because 130157537334673 - 25 = 130157537334641 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130157537334613) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3828162862768 + ... + 3828162862801.
It is an arithmetic number, because the mean of its divisors is an integer number (34453465765065).
Almost surely, 2130157537334673 is an apocalyptic number.
It is an amenable number.
130157537334673 is a deficient number, since it is larger than the sum of its proper divisors (7656325725587).
130157537334673 is an equidigital number, since it uses as much as digits as its factorization.
130157537334673 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7656325725586.
The product of its (nonzero) digits is 50009400, while the sum is 58.
The spelling of 130157537334673 in words is "one hundred thirty trillion, one hundred fifty-seven billion, five hundred thirty-seven million, three hundred thirty-four thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •