Base | Representation |
---|---|
bin | 1000011110011111100… |
… | …0000010110001000011 |
3 | 111220212210112020212012 |
4 | 2013213320002301003 |
5 | 4341214240232214 |
6 | 150522050523135 |
7 | 13343462562224 |
oct | 2074770026103 |
9 | 456783466765 |
10 | 145624149059 |
11 | 56839043614 |
12 | 242812964ab |
13 | 10969b2324c |
14 | 709656124b |
15 | 3bc486603e |
hex | 21e7e02c43 |
145624149059 has 2 divisors, whose sum is σ = 145624149060. Its totient is φ = 145624149058.
The previous prime is 145624149053. The next prime is 145624149091. The reversal of 145624149059 is 950941426541.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 145624149059 - 216 = 145624083523 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 145624148998 and 145624149016.
It is not a weakly prime, because it can be changed into another prime (145624149053) 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, 72812074529 + 72812074530.
It is an arithmetic number, because the mean of its divisors is an integer number (72812074530).
Almost surely, 2145624149059 is an apocalyptic number.
145624149059 is a deficient number, since it is larger than the sum of its proper divisors (1).
145624149059 is an equidigital number, since it uses as much as digits as its factorization.
145624149059 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1555200, while the sum is 50.
The spelling of 145624149059 in words is "one hundred forty-five billion, six hundred twenty-four million, one hundred forty-nine thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •