Base | Representation |
---|---|
bin | 11101101010001010000010… |
… | …001100001001010001111101 |
3 | 122002211222022122021212011102 |
4 | 131222022002030021101331 |
5 | 114044113304244020331 |
6 | 1141231244305502445 |
7 | 36322001151361340 |
oct | 3552120214112175 |
9 | 562758278255142 |
10 | 130440341001341 |
11 | 3862048aa16a58 |
12 | 12768266341a25 |
13 | 57a26187cb107 |
14 | 242d4bbd36457 |
15 | 10130bc8864cb |
hex | 76a28230947d |
130440341001341 has 32 divisors (see below), whose sum is σ = 159844790983680. Its totient is φ = 103895221248000.
The previous prime is 130440341001233. The next prime is 130440341001353. The reversal of 130440341001341 is 143100143044031.
It is not a de Polignac number, because 130440341001341 - 210 = 130440341000317 is a prime.
It is a super-2 number, since 2×1304403410013412 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130440341001371) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 705367991 + ... + 705552891.
It is an arithmetic number, because the mean of its divisors is an integer number (4995149718240).
Almost surely, 2130440341001341 is an apocalyptic number.
It is an amenable number.
130440341001341 is a deficient number, since it is larger than the sum of its proper divisors (29404449982339).
130440341001341 is a wasteful number, since it uses less digits than its factorization.
130440341001341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 260045.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 130440341001341 its reverse (143100143044031), we get a palindrome (273540484045372).
The spelling of 130440341001341 in words is "one hundred thirty trillion, four hundred forty billion, three hundred forty-one million, one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •