Base | Representation |
---|---|
bin | 11101101010001001111100… |
… | …001110110000100110111100 |
3 | 122002211222001200011110020110 |
4 | 131222021330032300212330 |
5 | 114044113103200222140 |
6 | 1141231230334550020 |
7 | 36321665525520456 |
oct | 3552117416604674 |
9 | 562758050143213 |
10 | 130440241023420 |
11 | 38620439540079 |
12 | 12768238968310 |
13 | 57a2600b94693 |
14 | 242d4ac94d2d6 |
15 | 10130b3bd8380 |
hex | 76a27c3b09bc |
130440241023420 has 192 divisors, whose sum is σ = 367486167638016. Its totient is φ = 34570323701760.
The previous prime is 130440241023419. The next prime is 130440241023493. The reversal of 130440241023420 is 24320142044031.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 7387443232 + ... + 7387460888.
It is an arithmetic number, because the mean of its divisors is an integer number (1913990456448).
Almost surely, 2130440241023420 is an apocalyptic number.
130440241023420 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130440241023420 is an abundant number, since it is smaller than the sum of its proper divisors (237045926614596).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130440241023420 is a wasteful number, since it uses less digits than its factorization.
130440241023420 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19180 (or 19178 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 30.
Adding to 130440241023420 its reverse (24320142044031), we get a palindrome (154760383067451).
The spelling of 130440241023420 in words is "one hundred thirty trillion, four hundred forty billion, two hundred forty-one million, twenty-three thousand, four hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.334 sec. • engine limits •