Base | Representation |
---|---|
bin | 1000011101001001011… |
… | …1100001110111001101 |
3 | 111212221122112102200121 |
4 | 2013102113201313031 |
5 | 4334444401213031 |
6 | 150422200424541 |
7 | 13331521466224 |
oct | 2072227416715 |
9 | 455848472617 |
10 | 145263304141 |
11 | 5667339147a |
12 | 241a0478151 |
13 | 10910140a47 |
14 | 706066dcbb |
15 | 3ba2d39011 |
hex | 21d25e1dcd |
145263304141 has 2 divisors, whose sum is σ = 145263304142. Its totient is φ = 145263304140.
The previous prime is 145263304133. The next prime is 145263304169. The reversal of 145263304141 is 141403362541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 103006334916 + 42256969225 = 320946^2 + 205565^2 .
It is a cyclic number.
It is not a de Polignac number, because 145263304141 - 23 = 145263304133 is a prime.
It is a super-2 number, since 2×1452633041412 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 145263304097 and 145263304106.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145263374141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72631652070 + 72631652071.
It is an arithmetic number, because the mean of its divisors is an integer number (72631652071).
Almost surely, 2145263304141 is an apocalyptic number.
It is an amenable number.
145263304141 is a deficient number, since it is larger than the sum of its proper divisors (1).
145263304141 is an equidigital number, since it uses as much as digits as its factorization.
145263304141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 34560, while the sum is 34.
Adding to 145263304141 its reverse (141403362541), we get a palindrome (286666666682).
The spelling of 145263304141 in words is "one hundred forty-five billion, two hundred sixty-three million, three hundred four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •