Base | Representation |
---|---|
bin | 11101101010000000100111… |
… | …110010010011011011010001 |
3 | 122002211000020021211102110121 |
4 | 131222000213302103123101 |
5 | 114043432104442434441 |
6 | 1141222453353030241 |
7 | 36321162540243436 |
oct | 3552004762233321 |
9 | 562730207742417 |
10 | 130430234343121 |
11 | 38617173a83059 |
12 | 127663056b5381 |
13 | 57a16979a868b |
14 | 242cbdd96bb8d |
15 | 1012bca45add1 |
hex | 76a027c936d1 |
130430234343121 has 16 divisors (see below), whose sum is σ = 139548386638080. Its totient is φ = 121711374645120.
The previous prime is 130430234343103. The next prime is 130430234343193. The reversal of 130430234343121 is 121343432034031.
It is a cyclic number.
It is not a de Polignac number, because 130430234343121 - 235 = 130395874604753 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130430234347121) 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 in 15 ways as a sum of consecutive naturals, for example, 728546601 + ... + 728725606.
It is an arithmetic number, because the mean of its divisors is an integer number (8721774164880).
Almost surely, 2130430234343121 is an apocalyptic number.
It is an amenable number.
130430234343121 is a deficient number, since it is larger than the sum of its proper divisors (9118152294959).
130430234343121 is a wasteful number, since it uses less digits than its factorization.
130430234343121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1457272344.
The product of its (nonzero) digits is 62208, while the sum is 34.
Adding to 130430234343121 its reverse (121343432034031), we get a palindrome (251773666377152).
The spelling of 130430234343121 in words is "one hundred thirty trillion, four hundred thirty billion, two hundred thirty-four million, three hundred forty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •