Base | Representation |
---|---|
bin | 100001000001011101101110… |
… | …000011001011101111010001 |
3 | 201001020102221002022012000121 |
4 | 201001131232003023233101 |
5 | 123014022131323130023 |
6 | 1232520323500350241 |
7 | 42406652400140155 |
oct | 4101355603135721 |
9 | 631212832265017 |
10 | 145236165442513 |
11 | 42305348103172 |
12 | 143578a9b45381 |
13 | 63069335cc752 |
14 | 27c1679d57065 |
15 | 11bcdd51c3d5d |
hex | 84176e0cbbd1 |
145236165442513 has 16 divisors (see below), whose sum is σ = 145794877615296. Its totient is φ = 144678588073920.
The previous prime is 145236165442451. The next prime is 145236165442583. The reversal of 145236165442513 is 315244561632541.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145236165442513 is a prime.
It is a super-2 number, since 2×1452361654425132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145236165442583) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1943415358 + ... + 1943490088.
It is an arithmetic number, because the mean of its divisors is an integer number (9112179850956).
Almost surely, 2145236165442513 is an apocalyptic number.
It is an amenable number.
145236165442513 is a deficient number, since it is larger than the sum of its proper divisors (558712172783).
145236165442513 is an equidigital number, since it uses as much as digits as its factorization.
145236165442513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82224.
The product of its digits is 10368000, while the sum is 52.
The spelling of 145236165442513 in words is "one hundred forty-five trillion, two hundred thirty-six billion, one hundred sixty-five million, four hundred forty-two thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •