Base | Representation |
---|---|
bin | 111100110010110100… |
… | …0111010000010111101 |
3 | 110110222112211121122011 |
4 | 1321211220322002331 |
5 | 4114333341204323 |
6 | 135550434251221 |
7 | 12301153511644 |
oct | 1714550720275 |
9 | 413875747564 |
10 | 130554241213 |
11 | 50405513820 |
12 | 21376426b11 |
13 | c40796b606 |
14 | 6466d4035b |
15 | 35e184320d |
hex | 1e65a3a0bd |
130554241213 has 4 divisors (see below), whose sum is σ = 142422808608. Its totient is φ = 118685673820.
The previous prime is 130554241193. The next prime is 130554241241. The reversal of 130554241213 is 312142455031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 130554241213 - 221 = 130552144061 is a prime.
It is a super-2 number, since 2×1305542412132 (a number of 23 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 (130554241273) 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, 5934283681 + ... + 5934283702.
It is an arithmetic number, because the mean of its divisors is an integer number (35605702152).
Almost surely, 2130554241213 is an apocalyptic number.
It is an amenable number.
130554241213 is a deficient number, since it is larger than the sum of its proper divisors (11868567395).
130554241213 is a wasteful number, since it uses less digits than its factorization.
130554241213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11868567394.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 130554241213 its reverse (312142455031), we get a palindrome (442696696244).
The spelling of 130554241213 in words is "one hundred thirty billion, five hundred fifty-four million, two hundred forty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •