Base | Representation |
---|---|
bin | 111100101001001010… |
… | …0111001110001111101 |
3 | 110110010222011011000002 |
4 | 1321102110321301331 |
5 | 4113202414331031 |
6 | 135454341444045 |
7 | 12260140456154 |
oct | 1712224716175 |
9 | 413128134002 |
10 | 130230230141 |
11 | 5025962a480 |
12 | 212a5a10625 |
13 | c3857b479b |
14 | 6435cba59b |
15 | 35c318eccb |
hex | 1e52539c7d |
130230230141 has 64 divisors (see below), whose sum is σ = 160353976320. Its totient is φ = 104230748160.
The previous prime is 130230230131. The next prime is 130230230147. The reversal of 130230230141 is 141032032031.
It is a de Polignac number, because none of the positive numbers 2k-130230230141 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130230230147) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 115965806 + ... + 115966928.
It is an arithmetic number, because the mean of its divisors is an integer number (2505530880).
Almost surely, 2130230230141 is an apocalyptic number.
130230230141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
130230230141 is a deficient number, since it is larger than the sum of its proper divisors (30123746179).
130230230141 is a wasteful number, since it uses less digits than its factorization.
130230230141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1554.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 130230230141 its reverse (141032032031), we get a palindrome (271262262172).
The spelling of 130230230141 in words is "one hundred thirty billion, two hundred thirty million, two hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •