Base | Representation |
---|---|
bin | 1000001101011101010… |
… | …0111011001101010001 |
3 | 111111002010100122212102 |
4 | 2003113110323031101 |
5 | 4302333143242210 |
6 | 144444224010145 |
7 | 13122250211324 |
oct | 2032724731521 |
9 | 444063318772 |
10 | 141051540305 |
11 | 54901a0aa15 |
12 | 23405a60955 |
13 | 103bb6a66b0 |
14 | 6b811547bb |
15 | 3a081d3ea5 |
hex | 20d753b351 |
141051540305 has 16 divisors (see below), whose sum is σ = 182488968144. Its totient is φ = 104042864640.
The previous prime is 141051540281. The next prime is 141051540389. The reversal of 141051540305 is 503045150141.
141051540305 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 18608233744 + 122443306561 = 136412^2 + 349919^2 .
It is not a de Polignac number, because 141051540305 - 216 = 141051474769 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 1174304 + ... + 1288833.
It is an arithmetic number, because the mean of its divisors is an integer number (11405560509).
Almost surely, 2141051540305 is an apocalyptic number.
It is an amenable number.
141051540305 is a deficient number, since it is larger than the sum of its proper divisors (41437427839).
141051540305 is a wasteful number, since it uses less digits than its factorization.
141051540305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2464036.
The product of its (nonzero) digits is 6000, while the sum is 29.
Adding to 141051540305 its reverse (503045150141), we get a palindrome (644096690446).
The spelling of 141051540305 in words is "one hundred forty-one billion, fifty-one million, five hundred forty thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •