Base | Representation |
---|---|
bin | 1000001101010101110… |
… | …1100001110011101010 |
3 | 111110222221110111110201 |
4 | 2003111131201303222 |
5 | 4302302140204010 |
6 | 144441145102414 |
7 | 13121420162146 |
oct | 2032535416352 |
9 | 443887414421 |
10 | 141020241130 |
11 | 5489628242a |
12 | 233b7487a0a |
13 | 103b5068282 |
14 | 6b7ad28226 |
15 | 3a055a023a |
hex | 20d5761cea |
141020241130 has 16 divisors (see below), whose sum is σ = 254847739104. Its totient is φ = 56183362000.
The previous prime is 141020241121. The next prime is 141020241133. The reversal of 141020241130 is 31142020141.
141020241130 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 141020241098 and 141020241107.
It is not an unprimeable number, because it can be changed into a prime (141020241133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28089172 + ... + 28094191.
It is an arithmetic number, because the mean of its divisors is an integer number (15927983694).
Almost surely, 2141020241130 is an apocalyptic number.
141020241130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
141020241130 is a deficient number, since it is larger than the sum of its proper divisors (113827497974).
141020241130 is a wasteful number, since it uses less digits than its factorization.
141020241130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56183621.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 141020241130 its reverse (31142020141), we get a palindrome (172162261271).
The spelling of 141020241130 in words is "one hundred forty-one billion, twenty million, two hundred forty-one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •