Base | Representation |
---|---|
bin | 11101101010001001111100… |
… | …001111111001000001010101 |
3 | 122002211222001200201112002200 |
4 | 131222021330033321001111 |
5 | 114044113103234220041 |
6 | 1141231230345155113 |
7 | 36321665531164263 |
oct | 3552117417710125 |
9 | 562758050645080 |
10 | 130440241320021 |
11 | 386204397229a6 |
12 | 12768238a8ba99 |
13 | 57a2600c69699 |
14 | 242d4ac9c9433 |
15 | 10130b3c461b6 |
hex | 76a27c3f9055 |
130440241320021 has 24 divisors (see below), whose sum is σ = 190634749980480. Its totient is φ = 85936119825600.
The previous prime is 130440241319981. The next prime is 130440241320091. The reversal of 130440241320021 is 120023142044031.
130440241320021 is a `hidden beast` number, since 1 + 3 + 0 + 4 + 40 + 2 + 413 + 200 + 2 + 1 = 666.
It is not a de Polignac number, because 130440241320021 - 26 = 130440241319957 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130440241320091) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 43002715 + ... + 45935976.
It is an arithmetic number, because the mean of its divisors is an integer number (7943114582520).
Almost surely, 2130440241320021 is an apocalyptic number.
It is an amenable number.
130440241320021 is a deficient number, since it is larger than the sum of its proper divisors (60194508660459).
130440241320021 is a wasteful number, since it uses less digits than its factorization.
130440241320021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88940617 (or 88940614 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 130440241320021 its reverse (120023142044031), we get a palindrome (250463383364052).
The spelling of 130440241320021 in words is "one hundred thirty trillion, four hundred forty billion, two hundred forty-one million, three hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •