Base | Representation |
---|---|
bin | 111100101110101001… |
… | …1000101001110101001 |
3 | 110110121210111222021211 |
4 | 1321131103011032221 |
5 | 4114042030131441 |
6 | 135524515033121 |
7 | 12264534164155 |
oct | 1713523051651 |
9 | 413553458254 |
10 | 130414302121 |
11 | 50343523484 |
12 | 2133759b7a1 |
13 | c3b4982c0c |
14 | 6452514065 |
15 | 35d43eea81 |
hex | 1e5d4c53a9 |
130414302121 has 4 divisors (see below), whose sum is σ = 133447192912. Its totient is φ = 127381411332.
The previous prime is 130414302089. The next prime is 130414302133. The reversal of 130414302121 is 121203414031.
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 130414302121 - 25 = 130414302089 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130414302092 and 130414302101.
It is not an unprimeable number, because it can be changed into a prime (130414303121) 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, 1516445331 + ... + 1516445416.
It is an arithmetic number, because the mean of its divisors is an integer number (33361798228).
Almost surely, 2130414302121 is an apocalyptic number.
It is an amenable number.
130414302121 is a deficient number, since it is larger than the sum of its proper divisors (3032890791).
130414302121 is an equidigital number, since it uses as much as digits as its factorization.
130414302121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3032890790.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 130414302121 its reverse (121203414031), we get a palindrome (251617716152).
The spelling of 130414302121 in words is "one hundred thirty billion, four hundred fourteen million, three hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •