Base | Representation |
---|---|
bin | 1000011101111000111… |
… | …0000000001100100111 |
3 | 111220110111200000100112 |
4 | 2013132032000030213 |
5 | 4340401301233133 |
6 | 150454022203235 |
7 | 13336454506616 |
oct | 2073616001447 |
9 | 456414600315 |
10 | 145462133543 |
11 | 567656449a1 |
12 | 24236b8351b |
13 | 109423a828c |
14 | 707cc2987d |
15 | 3bb5511648 |
hex | 21de380327 |
145462133543 has 2 divisors, whose sum is σ = 145462133544. Its totient is φ = 145462133542.
The previous prime is 145462133539. The next prime is 145462133561. The reversal of 145462133543 is 345331264541.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 145462133543 - 22 = 145462133539 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 145462133543.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (145462130543) 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, 72731066771 + 72731066772.
It is an arithmetic number, because the mean of its divisors is an integer number (72731066772).
Almost surely, 2145462133543 is an apocalyptic number.
145462133543 is a deficient number, since it is larger than the sum of its proper divisors (1).
145462133543 is an equidigital number, since it uses as much as digits as its factorization.
145462133543 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 518400, while the sum is 41.
The spelling of 145462133543 in words is "one hundred forty-five billion, four hundred sixty-two million, one hundred thirty-three thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •