Base | Representation |
---|---|
bin | 111100101110010110… |
… | …0001111111000011101 |
3 | 110110121002100202222112 |
4 | 1321130230033320131 |
5 | 4114031423402031 |
6 | 135523512523405 |
7 | 12264351515006 |
oct | 1713454177035 |
9 | 413532322875 |
10 | 130404122141 |
11 | 50338800077 |
12 | 213340b0565 |
13 | c3b282a467 |
14 | 64510241ad |
15 | 35d358d62b |
hex | 1e5cb0fe1d |
130404122141 has 4 divisors (see below), whose sum is σ = 130410436800. Its totient is φ = 130397807484.
The previous prime is 130404122099. The next prime is 130404122209. The reversal of 130404122141 is 141221404031.
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, and also an emirpimes, since its reverse is a distinct semiprime: 141221404031 = 46649 ⋅3027319.
It is a cyclic number.
It is not a de Polignac number, because 130404122141 - 26 = 130404122077 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 (130404122441) 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, 3126251 + ... + 3167688.
It is an arithmetic number, because the mean of its divisors is an integer number (32602609200).
Almost surely, 2130404122141 is an apocalyptic number.
It is an amenable number.
130404122141 is a deficient number, since it is larger than the sum of its proper divisors (6314659).
130404122141 is an equidigital number, since it uses as much as digits as its factorization.
130404122141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6314658.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 130404122141 its reverse (141221404031), we get a palindrome (271625526172).
The spelling of 130404122141 in words is "one hundred thirty billion, four hundred four million, one hundred twenty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •