Base | Representation |
---|---|
bin | 1000011101011100001… |
… | …0100010110011010001 |
3 | 111220011010000210120001 |
4 | 2013113002202303101 |
5 | 4340124433022131 |
6 | 150434040450001 |
7 | 13333462654513 |
oct | 2072702426321 |
9 | 456133023501 |
10 | 145341689041 |
11 | 5670365a18a |
12 | 24202779901 |
13 | 10923456c43 |
14 | 706ac35bb3 |
15 | 3ba9b6e261 |
hex | 21d70a2cd1 |
145341689041 has 2 divisors, whose sum is σ = 145341689042. Its totient is φ = 145341689040.
The previous prime is 145341689027. The next prime is 145341689089. The reversal of 145341689041 is 140986143541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 113650568641 + 31691120400 = 337121^2 + 178020^2 .
It is a cyclic number.
It is not a de Polignac number, because 145341689041 - 231 = 143194205393 is a prime.
It is a super-2 number, since 2×1453416890412 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 145341688982 and 145341689000.
It is not a weakly prime, because it can be changed into another prime (145341609041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72670844520 + 72670844521.
It is an arithmetic number, because the mean of its divisors is an integer number (72670844521).
Almost surely, 2145341689041 is an apocalyptic number.
It is an amenable number.
145341689041 is a deficient number, since it is larger than the sum of its proper divisors (1).
145341689041 is an equidigital number, since it uses as much as digits as its factorization.
145341689041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 414720, while the sum is 46.
The spelling of 145341689041 in words is "one hundred forty-five billion, three hundred forty-one million, six hundred eighty-nine thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •