Base | Representation |
---|---|
bin | 100001000001011001111110… |
… | …011111100011111011111101 |
3 | 201001020001112222200010022201 |
4 | 201001121332133203323331 |
5 | 123013440413431143241 |
6 | 1232514421005311501 |
7 | 42406450655333566 |
oct | 4101317637437375 |
9 | 631201488603281 |
10 | 145232146349821 |
11 | 42303675469363 |
12 | 14356b67b65591 |
13 | 6306442a548ab |
14 | 27c13b827316d |
15 | 11bcc4c42b931 |
hex | 84167e7e3efd |
145232146349821 has 2 divisors, whose sum is σ = 145232146349822. Its totient is φ = 145232146349820.
The previous prime is 145232146349813. The next prime is 145232146349861. The reversal of 145232146349821 is 128943641232541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 137474194553721 + 7757951796100 = 11724939^2 + 2785310^2 .
It is a cyclic number.
It is not a de Polignac number, because 145232146349821 - 23 = 145232146349813 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145232146349861) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72616073174910 + 72616073174911.
It is an arithmetic number, because the mean of its divisors is an integer number (72616073174911).
Almost surely, 2145232146349821 is an apocalyptic number.
It is an amenable number.
145232146349821 is a deficient number, since it is larger than the sum of its proper divisors (1).
145232146349821 is an equidigital number, since it uses as much as digits as its factorization.
145232146349821 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 9953280, while the sum is 55.
The spelling of 145232146349821 in words is "one hundred forty-five trillion, two hundred thirty-two billion, one hundred forty-six million, three hundred forty-nine thousand, eight hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •