Base | Representation |
---|---|
bin | 111100101110111100… |
… | …0100111000110111101 |
3 | 110110122111000210121220 |
4 | 1321131320213012331 |
5 | 4114102034441341 |
6 | 135525505543553 |
7 | 12265013620524 |
oct | 1713570470675 |
9 | 413574023556 |
10 | 130424140221 |
11 | 50349032a41 |
12 | 2133a944bb9 |
13 | c3b6a18b8b |
14 | 64539554bb |
15 | 35d51e4a66 |
hex | 1e5de271bd |
130424140221 has 8 divisors (see below), whose sum is σ = 175620624864. Its totient is φ = 86088541200.
The previous prime is 130424140219. The next prime is 130424140237. The reversal of 130424140221 is 122041424031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130424140221 - 21 = 130424140219 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130424140191 and 130424140200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130424140211) 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 7 ways as a sum of consecutive naturals, for example, 215221051 + ... + 215221656.
It is an arithmetic number, because the mean of its divisors is an integer number (21952578108).
Almost surely, 2130424140221 is an apocalyptic number.
It is an amenable number.
130424140221 is a deficient number, since it is larger than the sum of its proper divisors (45196484643).
130424140221 is a wasteful number, since it uses less digits than its factorization.
130424140221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 430442811.
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 130424140221 its reverse (122041424031), we get a palindrome (252465564252).
The spelling of 130424140221 in words is "one hundred thirty billion, four hundred twenty-four million, one hundred forty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •