Base | Representation |
---|---|
bin | 1000011100010100110… |
… | …1110011010101010011 |
3 | 111212101021100001201201 |
4 | 2013011031303111103 |
5 | 4334021404303301 |
6 | 150344235212031 |
7 | 13323202121056 |
oct | 2070515632523 |
9 | 455337301651 |
10 | 145042650451 |
11 | 5656a882056 |
12 | 2413a5a7017 |
13 | 108a650492a |
14 | 703d232a9d |
15 | 3b8d7a0201 |
hex | 21c5373553 |
145042650451 has 2 divisors, whose sum is σ = 145042650452. Its totient is φ = 145042650450.
The previous prime is 145042650391. The next prime is 145042650469. The reversal of 145042650451 is 154056240541.
145042650451 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 145042650451 - 27 = 145042650323 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 145042650451.
It is not a weakly prime, because it can be changed into another prime (145042650491) by changing a digit.
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 as a sum of consecutive naturals, namely, 72521325225 + 72521325226.
It is an arithmetic number, because the mean of its divisors is an integer number (72521325226).
Almost surely, 2145042650451 is an apocalyptic number.
145042650451 is a deficient number, since it is larger than the sum of its proper divisors (1).
145042650451 is an equidigital number, since it uses as much as digits as its factorization.
145042650451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96000, while the sum is 37.
Adding to 145042650451 its reverse (154056240541), we get a palindrome (299098890992).
The spelling of 145042650451 in words is "one hundred forty-five billion, forty-two million, six hundred fifty thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •